Approximate nearest neighbor search for $\ell_p$-spaces ($2 < p < \infty$) via embeddings
Computational Geometry
2015-12-08 v1 Data Structures and Algorithms
Abstract
While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and , few non-trivial algorithms are known for when (). In this paper, we revisit this fundamental problem and present approximate nearest-neighbor search algorithms which give the first non-trivial approximation factor guarantees in this setting.
Keywords
Cite
@article{arxiv.1512.01775,
title = {Approximate nearest neighbor search for $\ell_p$-spaces ($2 < p < \infty$) via embeddings},
author = {Yair Bartal and Lee-Ad Gottlieb},
journal= {arXiv preprint arXiv:1512.01775},
year = {2015}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1408.1789