Technical Reports

Browse Reports

Format: 2018
01-024 New Bound-Based Net Criticality Metrics for Timing-Driven Physical Design
01-023 Personalized Profile Based Search Interface With Ranked and Clustered Display
01-022 A Comparative Study on Web Prefetching
01-021 Multilevel Algorithms For Generic Coarse Grids For Multigrid Methods
01-020 Dynamic Load Balancing Algorithms for Sequence Mining
01-019 Functional Verification in IP Selection by Black-box Logic Simulation
01-018 Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-like Models
01-017 Parallel Tree Projection Algorithm for Sequence Mining
01-016 Incremental PDDP for the Clustering of Large Data Sets
01-015 Data Mining and Visualization of Twin-Cities Traffic Data
01-014 Detecting Graph-based Spatial Outliers: Algorithms and Applications
01-013 Dimension Reduction for Text Data Representation Based on Cluster Structure Preserving Projection
01-012 Extending the Product Family Approach to Support n-Dimensional and Hierarchical Product Lines
01-011 Discovering Spatial Co-location Patterns: A summary of Results
01-010 Dimension Reduction Based on Centroids and Least Squares for Efficient Processing of Text Data
01-009 A Balanced Term-Weighting Scheme for Effective Document Matching
01-008 Minimizing the total projection of a set of vectors, with applications to Layered Manufacturing
01-007 Computing an optimal hatching direction in Layered Manufacturing
01-006 Understanding Errors in Approximating Principal Direction Vectors
01-005 Coverage Based Test-Data Generation using Model Checkers
01-004 Web Proxy Server with Intelligent Prefetcher for Dynamic Pages Using Association Rules
01-003 Parallel Algorithm Scalability Issues in PetaFLOPS Architectures
01-002 Efficient Parallel Algorithms for Mining Associations
01-001 Parallel Algorithms in Data Mining
00-062 Lower Dimensional Representation of Text Data in Vector Space Based Information Retrieval
00-061 Server-Based Dynamic Server Selection Algorithms for Enterprise Networks
00-060 Video Streaming across Best-Effort Wide-Area Networks with Controlled Quality Assurance Using Proxy Servers
00-059 A Polynomial Time Approximation Scheme for the problem of Interconnecting Highways
00-058 Transmission Fault-Tolerance of Iterated Line Digraphs
00-057 Efficient Algorithms for Creating Product Catalogs
00-056 Selective Markov Models for Predicting Web-Page Accesses
00-055 Choosing the Cluster to Split in Bisecting Divisive Clustering Algorithms
00-054 An Extension of DHH-Erdös Conjecture on Cycle-Plus-Triangle Graphs with Application in Switching Networks
00-053 Exploring Decision Processes in Multi-Agent Automated Contracting
00-041 A Decomposition-Based Approach to Layered Manufacturing
00-052 A Quadratic Integer Programming with Application in Chaotic Mappings of Complete Multipartite Graphs
00-051 Rivest-Vuillemin Conjecture Is True for Monotone Boolean Functions with Twelve Variables
00-050 Optimal Consecutive-k-out-of-n: G Cycle for n <= 2k+1
00-049 Optimal Consecutive-k-out-of-(2k+1): G Cycle
00-048 Bisecting K-means and PDDP: A Comparative Analysis
00-047 Analysis of Recommendation Algorithms for E-Commerce
00-046 Evaluation of the Item-Based Top-N Recommendation Algorithms
00-045 On the Rearrangeability of Shuffle-Exchange Networks
00-044 Modeling and Processing Directional Relationships in Spatial Databases
00-043 Application of Dimensionality Reduction in Recommender System - A Case Study
00-042 Enhancing Visibility of Annotations of Software Artifacts
00-039 Consistency Checking for Euclidean Spatial Constraints: A Dimension Graph Approach
00-040 Using Group Knowledge to Track Multiple Vehicles Moving Across Terrain
00-038 Modeling of Web Robot Navigational Patterns
00-037 Indirect Association: Mining Higher Order Dependencies in Data