post office problem

(redirected from Nearest neighbor search)
Also found in: Wikipedia.

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.
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.
Kumar, "Privacy preserving nearest neighbor search," Machine Learning in Cyber Trust, pp.
Chen, "LSH-based algorithm for k nearest neighbor search on big data," Acta Electronica Sinica, vol.
Schmid, "Product quantization for nearest neighbor search," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.
Their method divides SURF keypoints into two groups and nearest neighbor search is realized in these groups.
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.
Excluded middle vantage point forests for nearest neighbor search. In Proceedings of the 6th DIMACS Implementation Challenge: Near neighbour searches (ALENEX 1999), January 1999.