लोड हो रहा है...
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,...
में बचाया:
| मुख्य लेखकों: | , , |
|---|---|
| स्वरूप: | Artigo |
| भाषा: | Inglês |
| प्रकाशित: |
National Academy of Sciences
2011
|
| विषय: | |
| ऑनलाइन पहुंच: | 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 |
| टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|