Technical Reports

Browse Reports

Format: 2018
03-032 MPI-based Adaptive Parallel Grid Services
03-031 Proactive vs Reactive Approaches to Failure Resilient Routing
03-030 Image-Based Reconstruction for View-Independent Human Motion Recognition
03-029 PAFI: A Pattern Finding Toolkit
03-028 Proceedings of the ECOOP 2003 Workshop on Exception Handling in Object-Oriented Systems: Towards Emerging Application Areas and New Programmi
03-027 Hierarchical Clustering Algorithms for Document Datasets
03-026 A new optimization criterion for generalized discriminant analysis on undersampled problems
03-025 Techniques for Visualizing Multi-Valued Flow Data
03-024 RESOURCE MANAGEMENT AND ALLOCATION IN COMPUTER AND COMMUNICATION NETWORKS
03-023 Model Checking Software Requirement Specifications Using Domain Reduction Abstraction
03-022 Multi-Constraint Mesh Partitioning for Contact/Impact Computations
03-021 A Distributed Approximation for Minamum Connecting Dominated Sets in Wireless Networks
03-020 TAPER: An Efficient Two-Step Approach for All-Pairs Correlation Query in Transaction Databases
03-019 Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization
03-018 Approximate Multiple Protein Structure Alignment Using the Sum-of-Pairs Distance
03-017 Kernel Discriminant Analysis based on Generalized Singular Value Decomposition
03-016 Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
03-015 Matrix Rank Reduction for Data Analysis and Feature Extraction
03-014 Text Classification using Support Vector Machines with Dimension Reduction
03-013 Generalizing Discriminant Analysis Using the Generalized Singular Value Decomposition
03-012 wCLUTO: A Web-Enabled Clustering Toolkit
03-011 Performance Evaluation of a Multi-Robot Search & Retrieval System: Experiences with MinDART
03-010 Usage Aware PageRank
03-009 Average Position of User Clicks as an Automated and Non-Intrusive Way of Evaluating Ranking Methods
03-008 Closed Dynamic Contours that Split and Merge
03-007 Prediction of Protein Relative Solvent Accessibility with Support Vector Machines and Long-range Interaction 3D Local Descriptor
03-006 Mining Hyperclique Patterns with Confidence Pruning
03-005 Protein Secondary Structure Prediction Based on an Improved Support Vector Machines Approach
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

Pages