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 structures 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 spar...
Guardado en:
| Autores principales: | Gil Costa, Graciela Verónica, Printista, Alicia Marcela, Reyes, Nora Susana, Marin Cahiuan, Juan Mauricio |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2005
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/9608 http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Dec05-21.pdf |
| Aporte de: |
Ejemplares similares
-
A parallel search algorithm for the SAT
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2005) -
Using parallel pivot vs. clustering-based techniques for web engines
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2007) -
Multimedia web searches using static SAT
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2006) -
Performance evaluation of improved Web search algorithms
por: Feuerstein, E., et al. -
A parallel view for search engines
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2005)