324 search results - page 33 / 65 » Distance Approximating Trees: Complexity and Algorithms |
PAKDD
2009
ACM
14 years 7 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
CVPR
1997
IEEE
14 years 11 months ago
1997
IEEE
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
STOC
2002
ACM
14 years 10 months ago
2002
ACM
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
SEBD
1997
13 years 11 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
BMCBI
2007
13 years 10 months ago
2007
Background: Construction and interpretation of phylogenetic trees has been a major research topic for understanding the evolution of genes. Increases in sequence data and complexi...