Capa do livro de Nearest Neighbor Search
Título do livro:

Nearest Neighbor Search

Betascript Publishing (2013-08-28 )

Books loader

Omni badge Apto para vale
ISBN- 1 3:

978-613-0-31688-4

ISBN- 1 0:
6130316887
EAN:
9786130316884
Idioma do livro:
Inglês
Anotações e citações/ texto breve:
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 a residence to the nearest post office.
Editora:
Betascript Publishing
Website:
https://www.betascript-publishing.com/
Editado por:
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Número de páginas:
72
Publicado em:
2013-08-28
Stock:
Disponível
Categoria:
Matemática
Preço:
29.00 €
Palavras chave:
Metric space, Euclidean Space, Euclidean distance, Taxicab Geometry, Donald Knuth, The Art of Computer Programming, Curse of Dimensionality, Analysis of Algorithms, Cardinality

Books loader

Adyen::diners Adyen::jcb Adyen::discover Adyen::amex Adyen::mc Adyen::visa Adyen::cup Adyen::alipay Adyen::wechatpay Adyen::unionpay PayPal Transferência Bancária

  0 produtos no carrinho
Editar carrinho
Loading frontend
LOADING