What is this site? It is generaly simplier version of wikipedia. You will find there selected articles. Enjoy!
Best Bin First is a search algorithm which is designed to efficiently find an approximate solution to the Nearest Neighbor Search Problem in very high dimensional spaces. The algorithm is based on a variant of the kd-tree search algorithm which makes indexing higher dimensional spaces possible. Best Bin First is an approximate algorithm which returns the nearest-neighbor for a large fraction of queries and a very close neighbor otherwise.
| O(n log n) | This algorithms-related article is a stub. You can help Wikipedia by expanding it. |