Probabilistic proximity searching algorithms based on compact partitions
Authors:
- Benjamin BustosBBBenjamin Bustos
- Gonzalo NavarroGNGonzalo Navarro
- 1 March 2004
- journal article
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 2 (1) , 115-134
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Pivot selection techniques for proximity searching in metric spacesPattern Recognition Letters, 2003
- Probabilistic proximity search: Fighting the curse of dimensionality in metric spacesInformation Processing Letters, 2003
- Searching in metric spaces by spatial approximationThe VLDB Journal, 2002
- Searching in metric spacesACM Computing Surveys, 2001
- Nearest Neighbor Queries in Metric SpacesDiscrete & Computational Geometry, 1999
- Approximate similarity retrieval with M-treesThe VLDB Journal, 1998
- Satisfying general proximity / similarity queries with metric treesInformation Processing Letters, 1991
- Voronoi trees and clustering problemsInformation Systems, 1987
- A Data Structure and an Algorithm for the Nearest Point ProblemIEEE Transactions on Software Engineering, 1983