Approximate nearest neighbors: towards removing the curse of dimensionality Export

@inproceedings{Indyk:1998:ApproxNN, 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}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.2920}, keywords = {approximation, geometry, hashing, local, nearest-neighbour, recognition, search, thesis}, pages = {604--613}, posted-at = {2007-09-17 19:20:37}, priority = {5}, title = {Approximate nearest neighbors: towards removing the curse of dimensionality}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.2920}, year = {1998} }

TY - CONF ID - Indyk:1998:ApproxNN 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 - approximation KW - geometry KW - hashing KW - local KW - nearest-neighbour KW - recognition KW - search KW - thesis AU - Indyk, Piotr AU - Motwani, Rajeev PY - 1998/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.2920 ER -