While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and ℓ1, few non-trivial algorithms are known for ℓp when 2<p<∞. In this paper, we revisit this fundamental problem and present approximate nearest-neighbor search algorithms which give the best known approximation factor guarantees in this setting.
- Nearest neighbor search
- ℓ spaces
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)