Approxiamate Nearest Neighbor Search in High Dimensions
The nearest neighbor problem is defined as follows: Given a set P of n points in some metric space (X; D), build a data structure that, given any point q, returns a point in P that is closest to q (its “nearest neighbor” in P). The data structure stores additional information about the set P, which...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
International Mathematical Union
2021
|
| Online Access: | https://hdl.handle.net/1721.1/129551 |