Boruvka meets nearest neighbors

Mostrar todas las versiones(3)

Computing the minimum spanning tree (MST) is a common task in the pattern recognition and the computer vision fields. However, little work has been done on efficient general methods for solving the problem on large datasets where graphs are complete and edge weights are given implicitly by a distanc...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Tepper, M., Musé, P., Almansa, A., Mejail, M.
Formato: Artículo publishedVersion
Publicado: 2013
Materias:
General method
Generic algorithm
Large datasets
Memory consumption
Minimum spanning trees
Nearest neighbors
Orders of magnitude
Search structures
Algorithms
Computer programming
Pattern recognition
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03029743_v8259LNCS_nPART2_p560_Tepper
https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_03029743_v8259LNCS_nPART2_p560_Tepper_oai
Aporte de:
Repositorio Digital de la Universidad de Buenos Aires (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares