Copertina di Nearest Neighbor Search
Titolo del libro:

Nearest Neighbor Search

Betascript Publishing (28.08.2013 )

Books loader

Omni badge eleggibile a buono
ISBN-13:

978-613-0-31688-4

ISBN-10:
6130316887
EAN:
9786130316884
Lingua del libro:
Inglese
Risvolto di copertina:
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.
Casa editrice:
Betascript Publishing
Sito Web:
https://www.betascript-publishing.com/
A cura di:
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Numero di pagine:
72
Pubblicato il:
28.08.2013
Giacenza di magazzino:
Disponibile
categoria:
Matematica
Prezzo:
29,00 €
Parole chiave:
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::unionpay Adyen::paypal Paypal Trasferimento

  0 prodotti nel carro d'acquisti
Modificare il carrello
Loading frontend
LOADING