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

Vision algorithms for hypercube machines

โœ Scribed by T.N. Mudge; T.S. Abdel-Rahman

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
926 KB
Volume
4
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Multicast Algorithms for Hypercube Multi
Multicast Algorithms for Hypercube Multiprocessors
โœ Shih-Hsien Sheu; Chang-Biau Yang ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 266 KB

Depending on different switching technologies, the multicast communication problem has been formulated as three different graph theoretical problems: the Steiner tree problem, the multicast tree problem, and the multicast path problem. Our efforts in this paper are to reduce the communication traffi

Numerical algorithms for the hypercube c
Numerical algorithms for the hypercube concurrent processor
โœ Jean E. Patterson; Farzin Manshadi; Ruel H. Calalo; Paulett C. Liewer; William A ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 270 KB

With the development of concurrent computing architectures which promise cost-effective means of obtaining supercomputing performance, there is much interest in applying and in evaluating the actual performance on large, computationally-intensive problems. Of particular interest is the concurrent pe