Probabilistic proximity searching algorithms based on compact partitions
From MaRDI portal
Publication:876710
DOI10.1016/S1570-8667(03)00067-4zbMath1118.68759MaRDI QIDQ876710
Gonzalo Navarro, Benjamin Bustos
Publication date: 26 April 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
probabilistic algorithmsapproximate algorithmsrange queriesauthor keywords: metric spacessimilarity searching
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Approximate similarity search: a multi-faceted problem
- Satisfying general proximity/similarity queries with metric trees
- Nearest neighbor queries in metric spaces
- Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.
- A Data Structure and an Algorithm for the Nearest Point Problem
- Pivot selection techniques for proximity searching in metric spaces
This page was built for publication: Probabilistic proximity searching algorithms based on compact partitions