post office problem
Also found in: Wikipedia.(redirected from Nearest neighbor search)
post office problem
(algorithm)Given a set of points (in N dimensions), find
another point which minimises the sum of the distances from
that point to each of the others.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
References in periodicals archive
There are various fast
nearest neighbor search methods.
Nearest neighbor search (NNS) algorithm has applied to computes the one-ring of mesh vertices.
Chen, "LSH-based algorithm for k
nearest neighbor search on big data," Acta Electronica Sinica, vol.
FNN: Fast
Nearest Neighbor Search Algorithms and Applications.
An effective algorithm is given in [12] to further extend the process of the
nearest neighbor search on multi-GPU.
The k
nearest neighbor search (kNN search) is one of the important types of spatial queries.
Fast
Nearest Neighbor Search in High-Dimensional Space, In: Proceedings of ICDE, Orlando, Florida, USA.
Therefore, only the
nearest neighbor search method is used here.
Copyright © 2003-2025 Farlex, Inc
Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.