Approximate nearest neighbor queries revisited
From MaRDI portal
Publication:1272961
DOI10.1007/PL00009390zbMath0910.68218MaRDI QIDQ1272961
Publication date: 2 December 1998
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Related Items (11)
On Locality-Sensitive Orderings and Their Applications ⋮ A strong lower bound for approximate nearest neighbor searching ⋮ Closest pair and the post office problem for stochastic points ⋮ Dense neighborhoods on affinity graph ⋮ The Euclidean k-Supplier Problem ⋮ Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings ⋮ On Locality-Sensitive Orderings and Their Applications ⋮ Smallest \(k\)-enclosing rectangle revisited ⋮ Smallest k-enclosing rectangle revisited ⋮ On approximate nearest neighbors under \(l_\infty\) norm ⋮ APPROXIMATE BREGMAN NEAR NEIGHBORS IN SUBLINEAR TIME: BEYOND THE TRIANGLE INEQUALITY
This page was built for publication: Approximate nearest neighbor queries revisited
