A Randomized Approximate Nearest Neighbors Algorithm

No Customer Reviews

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"

Related Subjects

Math Mathematics Science & Math

Customer Reviews

0 rating

Write a review

ThriftBooks sells millions of used books at the lowest everyday prices. We personally assess every book's quality and offer rare, out-of-print treasures. We deliver the joy of reading in recyclable packaging with free standard shipping on US orders over $15. ThriftBooks.com. Read more. Spend less.

Copyright © 2025 Thriftbooks.com Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks ^® and the ThriftBooks ^® logo are registered trademarks of Thrift Books Global, LLC

A Randomized Approximate Nearest Neighbors Algorithm

Recommended

Customer Reviews

Popular Categories

Website

My Account

Partnerships

Quick Help

About Us

Follow Us