We present an algorithm for c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time ofO(dn^{1/c^2+o(1)}) and space O(dn + n^{1+1/c^2+o(1)}).
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/30583 |
| Date | 04 November 2005 |
| Creators | Andoni, Alexandr, Indyk, Piotr |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 12 p., 11656417 bytes, 559939 bytes, application/postscript, application/pdf |
| Relation | Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory |
Page generated in 0.0017 seconds