Sciweavers

209 search results - page 10 / 42
» t-Spanners for metric space searching
Sort
View
DELOS
2007
14 years 11 months ago
MESSIF: Metric Similarity Search Implementation Framework
The similarity search has become a fundamental computational task in many applications. One of the mathematical models of the similarity – the metric space – has drawn attenti...
Michal Batko, David Novak, Pavel Zezula
ICALP
2004
Springer
15 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
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
15 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
VLDB
2002
ACM
138views Database» more  VLDB 2002»
14 years 9 months ago
Adaptable Similarity Search using Non-Relevant Information
Many modern database applications require content-based similarity search capability in numeric attribute space. Further, users' notion of similarity varies between search se...
T. V. Ashwin, Rahul Gupta, Sugata Ghosal
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
14 years 11 months ago
A Probabilistic Spell for the Curse of Dimensionality
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
Edgar Chávez, Gonzalo Navarro