On the Least Cost for Proximity Searching in Metric Spaces

DOI10.1007/11764298_26zbMath1196.68071OpenAlexW1489753557MaRDI QIDQ5307550

Rodrigo Paredes, Karina Figueroa, Edgar Chávez, Gonzalo Navarro

Publication date: 14 September 2007

Published in: Experimental Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11764298_26

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15)

Related Items (4)

Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN) ⋮ Parallel query processing on distributed clustering indexes ⋮ Solving similarity joins and range queries in metric spaces with the list of twin clusters ⋮ Counting distance permutations

This page was built for publication: On the Least Cost for Proximity Searching in Metric Spaces