✦ LIBER ✦

Parallel algorithms for contour extraction and coding on an EREW PRAM computer

✍ Scribed by Its'hak Dinstein; Gad M Landau

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 533 KB
Volume: 11
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(90)90118-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal EREW parallel algorithm for c

An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs

✍ H.S. Chao; F.R. Hsu; R.C.T. Lee 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Given a undirected graph G, the breadth-first search tree is constructed by a breadth-first search on G. In this paper, an optimal parallel algorithm is presented for constructing the breadth-first search tree for permutation graphs in O(log n) time by using O(n/Iog n) processors under the EREW PRAM

Coding of empirical parameters in the th

Coding of empirical parameters in the theory of vibrational spectra of polyatomic molecules and an algorithm for setting up their tables on a computer

✍ L. A. Gribov; M. A. El'yashevich 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 481 KB

An algorithm for calculating intramolecu

An algorithm for calculating intramolecular angle-dependent forces on vector computers: J. H. Dunn, Code 5842, Naval Research Laboratory, Washington, DC 20375-5000, USA; S. G. Lambrakos and P. G. Moore, Code 6320, Naval Research Laboratory, Washington, DC 20375-5000, USA; M. Nagumo, Code 6190, Naval Research Laboratory, Washington, DC 20375-5000, USA

📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 79 KB