Location of Repository

User Manual

By Marius Muja and David Lowe

Abstract

We can define the nearest neighbor search (NSS) problem in the following way: given a set of points P = p1, p2,..., pn in a metric space X, these points must be preprocessed in such a way that given a new query point q ∈ X, finding the point in P that is nearest to q can be done quickly

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.192.5378
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://people.cs.ubc.ca/%7Emar... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.