Probabilistic proximity searching algorithms based on compact partitions

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)

zbMATH Keywords

probabilistic algorithmsapproximate algorithmsrange queriesauthor keywords: metric spacessimilarity searching

Mathematics Subject Classification ID

Searching and sorting (68P10) Search theory (90B40) Randomized algorithms (68W20)

Related Items (1)

Approximate similarity search: a multi-faceted problem

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