Sciweavers

2836 search results - page 83 / 568
» Parsing Algorithms and Metrics
Sort
View
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
14 years 8 months ago
Finding nearest neighbors in growth-restricted metrics
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
David R. Karger, Matthias Ruhl
EDBT
2000
ACM
13 years 11 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
IPCO
1992
112views Optimization» more  IPCO 1992»
13 years 9 months ago
The Metric Polytope
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
Monique Laurent, Svatopluk Poljak
TKDE
2011
479views more  TKDE 2011»
13 years 2 months ago
Learning Semi-Riemannian Metrics for Semisupervised Feature Extraction
—Discriminant feature extraction plays a central role in pattern recognition and classification. Linear Discriminant Analysis (LDA) is a traditional algorithm for supervised feat...
Wei Zhang, Zhouchen Lin, Xiaoou Tang
APSEC
2005
IEEE
14 years 1 months ago
Metrics for Analyzing Module Interactions in Large Software Systems
We present a new set of metrics for analyzing the interaction between the modules of a large software system. We believe that these metrics will be important to any automatic or s...
Santonu Sarkar, Avinash C. Kak, N. S. Nagaraja