A parallel search algorithm for the SAT

In order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to use data strucures like the Spatial Approximation Tree (SAT). This structure is a nice example of a tree structure in which well-known tricks for tree parallelization simply do not work. It is too spars...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Gil Costa, Graciela Verónica, Printista, Alicia Marcela, Reyes, Nora Susana, Marín, Mauricio
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2005
Materias:
SAT
MPI
BSP
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23169
Aporte de:

Ejemplares similares