Обложка Nearest Neighbor Search
Название книги:

Nearest Neighbor Search

Metric space, Euclidean space, Euclidean distance, Taxicab geometry, Donald Knuth

PopulPublishing (2013-01-10 )

Books loader

Omni badge имеющий право на ваучер
ISBN-13:

978-613-9-14473-0

ISBN-10:
6139144736
EAN:
9786139144730
Язык Книги:
Английский
Краткое описание:
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Nearest neighbor search (NNS), also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric spaces. The problem is: given a set S of points in a metric space M and a query point q ∈ M, find the closest point in S to q. In many cases, M is taken to be d-dimensional Euclidean space and distance is measured by Euclidean distance or Manhattan distance. Donald Knuth in vol. 3 of The Art of Computer Programming (1973) called it the post-office problem, referring to an application of assigning to a residence the nearest post office.
Издательский Дом:
PopulPublishing
Веб-сайт:
http://www.betascript-publishing.com
Edited by:
Dewayne Rocky Aloysius
Количество страниц:
80
Опубликовано:
2013-01-10
Акции:
В наличии
Категория:
Общие социальные науки
Цена:
34.00 €
Ключевые слова:
space, distance, Donald, geometry, Taxicab, Euclidean, Knuth

Books loader

Adyen::diners Adyen::jcb Adyen::discover Adyen::amex Adyen::mc Adyen::visa Adyen::cup Adyen::ach Adyen::unionpay Adyen::paypal Paypal Банковский перевод

  0 продуктов в корзине
Редактировать корзину
Loading frontend
LOADING