Approximate nearest neighbors: towards removing the curse of dimensionality

@inproceedings{citeulike:1513087, abstract = {The nearest neighbor problem is the following: Given a set of n points P in some metric space X, preprocess P so as to efficiently answer queries which require finding the point in P closest to the query point q in X. We focus on the particularly interesting case of the d-dimensional Euclidean space where X = R-d under some l-p norm.}, author = {Indyk, Piotr and Motwani, Rajeev }, booktitle = {Proc. of 30th STOC}, citeulike-article-id = {1513087}, keywords = {hash, identification, image, search, similarity, video}, pages = {604--613}, posted-at = {2007-07-30 16:28:10}, priority = {0}, title = {Approximate nearest neighbors: towards removing the curse of dimensionality}, url = {http://citeseer.ist.psu.edu/199392.html}, year = {1998} }

TY - CONF ID - citeulike:1513087 L3 - citeulike-article-id:1513087 N2 - The nearest neighbor problem is the following: Given a set of n points P in some metric space X, preprocess P so as to efficiently answer queries which require finding the point in P closest to the query point q in X. We focus on the particularly interesting case of the d-dimensional Euclidean space where X = R-d under some l-p norm. EP - 613 TI - Approximate nearest neighbors: towards removing the curse of dimensionality T2 - Proc. of 30th STOC SP - 604 KW - hash KW - identification KW - image KW - search KW - similarity KW - video AU - Indyk, Piotr AU - Motwani, Rajeev PY - 1998/// UR - http://citeseer.ist.psu.edu/199392.html ER -