✦ LIBER ✦

Modelling a fast parallel thinning algorithm for shared memory SIMD computers

✍ Scribed by Rabi N. Mahapatra; Harish Pareek

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 475 KB
Volume: 40
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90120-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A modified fast parallel algorithm for t

A modified fast parallel algorithm for thinning digital patterns

✍ Yung-Sheng Chen; Wen-Hsing Hsu 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 487 KB

A fast general algorithm for extracting

A fast general algorithm for extracting image features on SIMD mesh-connected computers

✍ Hongchi Shi; Gerhard X. Ritter; Joseph N. Wilson 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 504 KB

Extracting features of components in an image is an important step for recognition of objects in the image. In this paper, we develop a general formula for extracting some geometric features of image components such as area, perimeter, compactness, height, width, diameter, moments, and centroid. We

Parallel implementation of a ray tracing

Parallel implementation of a ray tracing algorithm for distributed memory parallel computers

✍ Lee, Tong-Yee; Raghavendra, C. S.; Nicholas, John B. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 3 views

Ray tracing is a well known technique to generate life-like images. Unfortunately, ray tracing complex scenes can require large amounts of CPU time and memory storage. Distributed memory parallel computers with large memory capacities and high processing speeds are ideal candidates to perform ray tr

Vector and parallel algorithms for the m

Vector and parallel algorithms for the molecular dynamics simulation of macromolecules on shared-memory computers

✍ John E. Mertz; Douglas J. Tobias; Charles L. Brooks III; U. C. Singh 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 797 KB

## Abstract A detailed description of vector/parallel algorithms for the molecular dynamics (MD) simulation of macromolecular systems on multiple processor, shared‐memory computers is presented. The algorithms encompass three computationally intensive portions of typical MD programs: (__1__) the ev

Development of a parallel molecular dyna

Development of a parallel molecular dynamics code on SIMD computers: Algorithm for use of pair list criterion

✍ Roccatano, D.; Bizzarri, R.; Chillemi, G.; Sanna, N.; Di Nola, A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB 👁 3 views

In recent years several implementations of molecular dynamics Ž . Ž . MD codes have been reported on multiple instruction multiple data MIMD machines. However, very few implementations of MD codes on single instruction Ž . multiple data SIMD machines have been reported. The difficulty in using pair

A fast algorithm for parallel model comb

A fast algorithm for parallel model combination for noisy speech recognition

✍ Tai-Hwei Hwang; Hsiao-Chuan Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Based on the log-normal assumption, parallel model combination (PMC) provides an effective method to adapt the cepstral means and variances of speech models for noisy speech recognition. In addition, the log-add method has been derived to adapt the mean by ignoring the cepstral variance during the p