ACM

Communications of the ACM

Home/Magazine Archive/January 2008 (Vol. 51, No. 1)/Near-Optimal Hashing Algorithms for Approximate Nearest.../Abstract

Breakthrough research: a preview of things to come

Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions

By Alexandr Andoni, Piotr Indyk
Communications of the ACM, January 2008, Vol. 51 No. 1, Pages 117-122
10.1145/1327452.1327494
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) In the Digital Edition Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.