This paper describes a novel method which extends the search algorithm of a k-d tree for aligning and merging range images. If the nearest neighbor point is far from a query, many...
This paper proposes a new problem, called superseding nearest neighbor search, on uncertain spatial databases, where each object is described by a multidimensional probability den...
Sze Man Yuen, Yufei Tao, Xiaokui Xiao, Jian Pei, D...
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we p...
Nearest neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions with finite samples due to the curse o...