Nearest neighbor search and k-nearest neighbor graph construction are two fundamental issues arise from many disciplines such as information retrieval, data-mining, machine learning and computer vision. Despite continuous efforts have been taken in the last several decades, these two issues remain challenging. They become more and more imminent given the big data emerges in various fields and h...

Abstract Symmetry of superconducting pairing is one the cardinal issues in superconductivity. In general, nearest-neighbor and next-nearest-neighbor pairings cannot spontaneously mix with each other constrained by distinct symmetry classification, for example ...

w0-Nearest Points and w0-Farthest Point in Normed Linear Spaces

Finding Nearest Neighbors efficiently is crucial to the design of any nearest neighbor classifier. This paper shows how Layered Range Trees could be used for efficient nearest neighbor classification. The presented algorithm is simple and finds the nearest neighbor in a logarithmic order. It performs d log n + k distance measures to find the nearest neighbor, where k is a constant that is much ...