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...
Guardado en:
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: | |
Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23169 |
Aporte de: |
Ejemplares similares
-
Multimedia web searches using static SAT
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2006) -
Using parallel pivot vs. clustering-based techniques for web engines
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2007) -
A parallel spatial quantum search algorithm applied to the 3-SAT problem
por: Hernández Barreto, Miguel A., et al.
Publicado: (2011) -
A parallel search algorithm for the SAT
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2005) -
An unbalanced approach to metric space searching
por: Chávez, Edgar, et al.
Publicado: (2005)