Lanean...

Randomized approximate nearest neighbors algorithm

We present a randomized algorithm for the approximate nearest neighbor problem in d-dimensional Euclidean space. Given N points {x(j)} in [Image: see text], the algorithm attempts to find k nearest neighbors for each of x(j), where k is a user-specified integer parameter. The algorithm is iterative,...

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Egile Nagusiak: Jones, Peter Wilcox, Osipov, Andrei, Rokhlin, Vladimir
Formatua: Artigo
Hizkuntza:Inglês
Argitaratua: National Academy of Sciences 2011
Gaiak:
Sarrera elektronikoa:https://ncbi.nlm.nih.gov/pmc/articles/PMC3179075/
https://ncbi.nlm.nih.gov/pubmed/21885738
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.1107769108
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!