𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal visibility algorithms for binary images on the hypercube

✍ Scribed by Frank Dehne; Quoc T. Pham; Ivan Stojmenović

Publisher
Springer
Year
1990
Tongue
English
Weight
596 KB
Volume
19
Category
Article
ISSN
1573-7640

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Efficient Algorithm for Gray-to-Binar
An Efficient Algorithm for Gray-to-Binary Permutation on Hypercubes
✍ C.T. Ho; M.T. Raghunath; S.L. Johnsson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 539 KB

Both Gray code and binary code are frequently used in mapping arrays into hypercube architectures. While the former is preferred when communication between adjacent array elements is needed, the latter is preferred for FFT-type communication. When different phases of computations have different type

A New Efficient Algorithm for Embedding
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
✍ Volker Heun; Ernst W. Mayr 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 250 KB

The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making it desirable to simulate binary trees on a hypercube. In this paper, we present a simple one-to-one embedding of arbitrar