New LSH-based Algorithm for Approximate Nearest Neighbor
| dc.date.accessioned | 2005-12-22T02:40:39Z | |
| dc.date.accessioned | 2018-11-24T10:24:40Z | |
| dc.date.available | 2005-12-22T02:40:39Z | |
| dc.date.available | 2018-11-24T10:24:40Z | |
| dc.date.issued | 2005-11-04 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/30583 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/30583 | |
| dc.description.abstract | 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)}). | |
| dc.format.extent | 12 p. | |
| dc.format.extent | 11656417 bytes | |
| dc.format.extent | 559939 bytes | |
| dc.language.iso | en_US | |
| dc.subject | AI | |
| dc.subject | locality sensitive hashing | |
| dc.subject | nearest neighbor | |
| dc.subject | high dimensions | |
| dc.title | New LSH-based Algorithm for Approximate Nearest Neighbor |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| MIT-CSAIL-TR-2005-073.pdf | 559.9Kb | application/pdf | View/ |
| MIT-CSAIL-TR-2005-073.ps | 11.65Mb | application/postscript | View/ |