Lanean...

Efficient Computation of k-Nearest Neighbour Graphs for Large High-Dimensional Data Sets on GPU Clusters

This paper presents an implementation of the brute-force exact k-Nearest Neighbor Graph (k-NNG) construction for ultra-large high-dimensional data cloud. The proposed method uses Graphics Processing Units (GPUs) and is scalable with multi-levels of parallelism (between nodes of a cluster, between di...

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Egile Nagusiak: Dashti, Ali, Komarov, Ivan, D’Souza, Roshan M.
Formatua: Artigo
Hizkuntza:Inglês
Argitaratua: Public Library of Science 2013
Gaiak:
Sarrera elektronikoa:https://ncbi.nlm.nih.gov/pmc/articles/PMC3781071/
https://ncbi.nlm.nih.gov/pubmed/24086314
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1371/journal.pone.0074113
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!