Cargando…
Fast k-NNG Construction with GPU-Based Quick Multi-Select
In this paper, we describe a new brute force algorithm for building the [Image: see text]-Nearest Neighbor Graph (k-NNG). The k-NNG algorithm has many applications in areas such as machine learning, bio-informatics, and clustering analysis. While there are very efficient algorithms for data of low d...
Autores principales: | Komarov, Ivan, Dashti, Ali, D'Souza, Roshan M. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4014471/ https://www.ncbi.nlm.nih.gov/pubmed/24809341 http://dx.doi.org/10.1371/journal.pone.0092409 |
Ejemplares similares
-
Efficient Computation of k-Nearest Neighbour Graphs for Large High-Dimensional Data Sets on GPU Clusters
por: Dashti, Ali, et al.
Publicado: (2013) -
Genome Editing in Zebrafish by ScCas9 Recognizing NNG PAM
por: Liu, Yunxing, et al.
Publicado: (2021) -
Fast Analytic Simulation for Multi-Laser Heating of Sheet Metal in GPU
por: Mejia-Parra, Daniel, et al.
Publicado: (2018) -
Gerbil: a fast and memory-efficient k-mer counter with GPU-support
por: Erbert, Marius, et al.
Publicado: (2017) -
Accelerating the Gillespie Exact Stochastic Simulation Algorithm Using Hybrid Parallel Execution on Graphics Processing Units
por: Komarov, Ivan, et al.
Publicado: (2012)