Beyond locality-sensitive hashing
We present a new data structure for the c-approximate near neighbor problem (ANN) in the Euclidean space. For n points in R[superscript d], our algorithm achieves O[subscript c](n[superscript ρ] + d log n) query time and O[subscript c](n[superscript 1+ρ] + d log n) space, where ρ ≤ 7/(8c[superscript...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Association for Computing Machinery
2018
|
| Online Access: | http://hdl.handle.net/1721.1/114155 https://orcid.org/0000-0002-7983-9524 https://orcid.org/0000-0002-3962-721X |
Search Result 1
