Sciweavers

184 search results - page 5 / 37
» Near Neighbor Search in Large Metric Spaces
Sort
View
ADC
2003
Springer
127views Database» more  ADC 2003»
14 years 3 months ago
M+-tree : A New Dynamical Multidimensional Index for Metric Spaces
In this paper, we propose a new metric index, called M+ -tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M+ -tree takes full advantag...
Xiangmin Zhou, Guoren Wang, Jeffrey Xu Yu, Ge Yu
DEXAW
1999
IEEE
168views Database» more  DEXAW 1999»
14 years 2 months ago
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
Paolo Ciaccia, Marco Patella
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
14 years 10 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
ICALP
2004
Springer
14 years 3 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
WIDM
2009
ACM
14 years 4 months ago
Distinct nearest neighbors queries for similarity search in very large multimedia databases
As the volume of multimedia data available on internet is tremendously increasing, the content-based similarity search becomes a popular approach to multimedia retrieval. The most...
Tomás Skopal, Vlastislav Dohnal, Michal Bat...