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...
Spremljeno u:
| Izdano u: | Journal of Computer Science and Technology |
|---|---|
| Glavni autori: | , , , |
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Universidad Nacional de La Plata
2005
|
| Teme: | |
| Online pristup: | https://www.redalyc.org/articulo.oa?id=638067343003 |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|