Sciweavers

217 search results - page 4 / 44
» Searching in metric spaces with user-defined and approximate...
Sort
View
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
13 years 9 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
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
14 years 1 months ago
On Approximating the Average Distance Between Points
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
Kfir Barhum, Oded Goldreich, Adi Shraibman
SPIRE
2005
Springer
14 years 1 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
GIS
2002
ACM
13 years 7 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
DEXA
2009
Springer
222views Database» more  DEXA 2009»
14 years 2 months ago
On Index-Free Similarity Search in Metric Spaces
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
Tomás Skopal, Benjamin Bustos