Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality. Har-Peled, S., Indyk, P., & Motwani, R. *Theory of Computing*, 8(14):321–350, Theory of Computing, 2012. Paper doi bibtex @Article{peled12approximate,
author = {Har-Peled, Sariel and Indyk, Piotr and Motwani, Rajeev},
title = {Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality},
journal = {Theory of Computing},
year = {2012},
volume = {8},
number = {14},
pages = {321--350},
doi = {10.4086/toc.2012.v008a014},
owner = {Purva},
publisher = {Theory of Computing},
timestamp = {2016-09-18},
url = {http://www.theoryofcomputing.org/articles/v008a014},
}

Downloads: 0

{"_id":"FnPDB5gkCkmhYMYBW","bibbaseid":"harpeled-indyk-motwani-approximatenearestneighbortowardsremovingthecurseofdimensionality-2012","downloads":0,"creationDate":"2016-02-19T04:14:21.526Z","title":"Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality","author_short":["Har-Peled, S.","Indyk, P.","Motwani, R."],"year":2012,"bibtype":"article","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Har-Peled"],"firstnames":["Sariel"],"suffixes":[]},{"propositions":[],"lastnames":["Indyk"],"firstnames":["Piotr"],"suffixes":[]},{"propositions":[],"lastnames":["Motwani"],"firstnames":["Rajeev"],"suffixes":[]}],"title":"Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality","journal":"Theory of Computing","year":"2012","volume":"8","number":"14","pages":"321–350","doi":"10.4086/toc.2012.v008a014","owner":"Purva","publisher":"Theory of Computing","timestamp":"2016-09-18","url":"http://www.theoryofcomputing.org/articles/v008a014","bibtex":"@Article{peled12approximate,\n author = {Har-Peled, Sariel and Indyk, Piotr and Motwani, Rajeev},\n title = {Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality},\n journal = {Theory of Computing},\n year = {2012},\n volume = {8},\n number = {14},\n pages = {321--350},\n doi = {10.4086/toc.2012.v008a014},\n owner = {Purva},\n publisher = {Theory of Computing},\n timestamp = {2016-09-18},\n url = {http://www.theoryofcomputing.org/articles/v008a014},\n}\n\n","author_short":["Har-Peled, S.","Indyk, P.","Motwani, R."],"key":"peled12approximate","id":"peled12approximate","bibbaseid":"harpeled-indyk-motwani-approximatenearestneighbortowardsremovingthecurseofdimensionality-2012","role":"author","urls":{"Paper":"http://www.theoryofcomputing.org/articles/v008a014"},"downloads":0},"search_terms":["approximate","nearest","neighbor","towards","removing","curse","dimensionality","har-peled","indyk","motwani"],"keywords":[],"authorIDs":[],"dataSources":["C5FtkvWWggFfMJTFX"]}