A Randomized Approximate Nearest Neighbors Algorithm

by Andrei Osipov

The classical nearest neighbors problem is formulated as follows: given a collection of N points in the Euclidean space R^d, for each point, find its k nearest neighbors (i.e. closest points).... This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 3659128384
• ISBN13: 9783659128387
• Release Date: May 2012
• Publisher: LAP Lambert Academic Publishing
• Length: 136 Pages
• Weight: 0.46 lbs.
• Dimensions: 0.3" x 6.0" x 9.0"