Thumbnail
Access Restriction
Subscribed

Author Indyk, Piotr ♦ Andoni, Alexandr
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract In this article, we give an overview of efficient algorithms for the approximate and exact nearest neighbor problem. The goal is to preprocess a dataset of objects (e.g., images) so that later, given a new query object, one can quickly return the dataset object that is most similar to the query. The problem is of significant interest in a wide variety of areas.
Description Affiliation: Massachusetts Institute of Technology, Cambridge, MA (Indyk, Piotr)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 51
Issue Number 1
Page Count 6
Starting Page 117
Ending Page 122


Open content in new tab

   Open content in new tab
Source: ACM Digital Library