✦ LIBER ✦

Finding fundamental cycles and bridges on a tree-structured parallel computer

✍ Scribed by D.Y. Yeh

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 428 KB
Volume: 40
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(86)90013-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graph algorithms on a tree-structured pa

Graph algorithms on a tree-structured parallel computer

✍ D. Y. Yeh; D. T. Lee 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 438 KB

Parallel realizations of Kanerva's spars

Parallel realizations of Kanerva's sparse distributed memory on a tree-shaped computer

✍ Hämäläinen, Timo; Klapuri, Harri; Saarinen, Jukka; Kaski, Kimmo 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 311 KB 👁 3 views

This paper presents two parallel realizations of sparse distributed memory (SDM) on a treeshaped computer. The original model of SDM is introduced in terms of generalized computer memory and artificial neural networks (ANNs). For parallellization purposes, addressing, storage and retrieval operation