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...
Gardado en:
| Publicado en: | Journal of Computer Science and Technology |
|---|---|
| Principais autores: | , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Universidad Nacional de La Plata
2005
|
| Assuntos: | |
| Acceso en liña: | https://www.redalyc.org/articulo.oa?id=638067343003 |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|