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

Edge intersection on the hypercube computer

โœ Scribed by Chandrasekhar Narayanaswani; William Randolph Franklin

Book ID
107766057
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
623 KB
Volume
41
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Edge-cutsets in the directed hypercube
Edge-cutsets in the directed hypercube
โœ Paul L. Mariz; Shahriar Shahriari ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 98 KB
Distributed Computing on Anonymous Hyper
Distributed Computing on Anonymous Hypercube Networks
โœ Evangelos Kranakis; Danny Krizanc ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 245 KB

We consider the bit-complexity i.e.a, total number of bits transmitted of computing boolean functions on an anonymous canonically labeled n-dimensional hypercube network and give a characterization of the boolean functions computable on such a network as exactly those boolean functions which are inv

Computing biconnected components on a hy
Computing biconnected components on a hypercube
โœ Jinwoon Woo; Sartaj Sahni ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Springer US ๐ŸŒ English โš– 712 KB

We describe two hypercube algorithms to find the biconnected components of a dense connected undirected graph. One is a modified version of the Tarjan-Vishkin algorithm and the other is an adaptation of Read's sequential algorithm. The two hypercube algorithms were experimentally evaluated on an NCU

Computing Hough transforms on hypercube
Computing Hough transforms on hypercube multicomputers
โœ Sanjay Ranka; Sartaj Sahni ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Springer US ๐ŸŒ English โš– 843 KB

Efficient algorithms to compute the Hough transform on M1MD and SIMD hypercube multicomputers are developed. Our algorithms can compute p angles of the Hough transform of an N x N image, p < N, in 0(p + log N) time on both MIMD and SIMD hypercubes. These algorithms require 0(N ~) processors. We also