๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal parallel hypercube algorithms for polygon problems

โœ Scribed by Atallah, M.J.; Chen, D.Z.

Book ID
119772335
Publisher
IEEE
Year
1995
Tongue
English
Weight
829 KB
Volume
44
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal Parallel Algorithms for Quadtree
Optimal Parallel Algorithms for Quadtree Problems
โœ S. Kasif ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science โš– 449 KB

In this paper we describe optimal processor-time parallel algorithms for set operations such as union, intersection, comparison on quadtrees. The algorithms presented in this paper run in \(O(\log\) \(N\) ) time using \(N / \log N\) processors on a shared memory model of computation that allows conc

Optimal Parallel Algorithms for Computer
Optimal Parallel Algorithms for Computer Vision Problems
โœ Chin-Hsiung Wu; Shi-Jinn Horng; Horng-Ren Tsai ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 315 KB

The computational model on which the algorithms are developed is the arrays with reconfigurable optical buses (abbreviated to AROB). It integrates the advantages of both optical transmission and electronic computation. In this paper, instead of using the radix-2 system, a radix-x system can be used