This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
Given a query point p, typically the position of a current client, and two datasets S and R, a transitive nearest neighbor (TNN) search returns a pair of objects (s, r) ∈ S × R...
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
Abstract. A nearest neighbor search procedure is presented, for retrieving resources in knowledge bases expressed in OWL. The procedure exploits a semidistance for annotated resour...
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...