Technical Reports

Browse Reports

Format: 2020
03-004 Finding Frequent Patterns Using Length-Decreasing Support Constraints
03-003 Parallel Formulations of Tree-Projection Based Sequence Mining Algorithms
03-002 Item-Based Top-N Recommendation Algorithms
03-001 Pairwise Protein Structure Alignment Based on an Orientation-Independent Representation of the Backbone Geometry
02-041 Nonlinear Feature Extraction based on Centroids and Kernel Functions
02-040 Adaptive Packet Sampling for Flow Volume Measurement
02-039 Prediction of Contact Maps Using Support Vector Machines
02-038 Wireless Sensor Networks with Energy Efficient Organization
02-037 Correlation Analysis of Spatial Time Series Datasets: A Filter-and-Refine Approach
02-036 Efficient Candidate Generation by Joining for Frequent Subgraph Discovery
02-035 Coverage based Proxy Placement for Content Distribution over the Internet
02-034 Asking the Right Question: Risk and Expectation in Multi-Agent Contracting
02-033 Discovering Co-location Patterns from Spatial Datasets: A General Approach
02-032 Speculative Register Promotion Using Advanced Load Address Table (ALAT)
02-031 Transpose-free Multiple Lanczos and Its Application in Pade` Approximation
02-030 Energy-efficient Broadcast and Multicast Routing in Ad Hoc Wireless Networks
02-029 Adaptive Proportional Routing: A Localized QoS Routing Approach
02-028 Full-Sharing Optimal Scheduling for VOD Service on Broadband Cable Networks
02-027 Automated Approaches for Classifying Structures
02-026 An Efficient Algorithm for Discovering Frequent Subgraphs
02-025 Multilevel Hypergraph Partitioning
02-024 Discovering Geometric Frequent Subgraphs
02-023 SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
02-022 Evaluation of Hierarchical Clustering Algorithms for Document Datasets
02-021 Extension of Discriminant Analysis based on the Generalized Singular Value Decomposition
02-020 Supporting Innovation: A Behavior-Sketching Tool for Early Multimedia Design
02-019 The Multi-resolution Co-location Miner: A New Algorithm to Find Co-location Patterns in Spatial Dataset
02-018 Performance Evaluation of Co-location Miner
02-017 CLUTO - A Clustering Toolkit
02-016 Clustering in Life Sciences
02-015 A Polynomial Time Approximation Scheme for Rectlinear Steiner Mininum Tree Construction in the Presence of Obstacles
02-014 Comparison of Agglomerative and Partitional Document Clustering Algorithms
02-013 Domain Reduction Abstraction
02-012 Optimal Relay Location for Resource-Limited Energy-Efficient Wireless Communication
02-011 Using Conjunction of Attribute Values for Classification
02-010 Interprocedural Induction Variable Analysis
02-009 Multi-Agent Negotiation using Combinatorial Auctions with Precedence Constraints
02-008 Spatial Contextual Classification and Prediction Models for Mining Geospatial Data
02-006 Phase Locality Detection Using a Branch Trace Buffer for Efficient Profiling in Dynamic Optimization
02-005 Visual Servoing of a Miniature Robot Toward a Marked Target
02-007 The Development of Extended Pattern Matching Operators and a Supporting Operator Framework for Relational Database Management Systems
02-004 Relay Sensor Placement in Wireless Sensor Networks
02-003 Polynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks
02-002 Virtual Backbone-Based Routing in Multihop Ad Hoc Wireless Networks
02-001 Dictionary Design Algorithms for Vector Map Compression
01-048 A PTAS for the Grade of Service Steiner Minimum Tree Problem
01-047 Approximation Solutions for the Resource Management Problem Using the General Cover Problem
01-046 Transaction-based Waveform Analysis for Functional Verification in IP Selection
01-045 A Unified Approach to Spatial Outlier Detection
01-044 Approximation ratio 2 for the Minimum number of Steiner Points