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...
-д хадгалсан:
| -д хэвлэсэн: | Journal of Computer Science and Technology |
|---|---|
| Үндсэн зохиолчид: | , , , |
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
Universidad Nacional de La Plata
2005
|
| Нөхцлүүд: | |
| Онлайн хандалт: | https://www.redalyc.org/articulo.oa?id=638067343003 |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|