✦ LIBER ✦

Coarse-Grained Parallel Algorithms for Multi-Dimensional Wavelet Transforms

✍ Scribed by Linda Yang; Manavendra Misra

Book ID: 110257113
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 453 KB
Volume: 12
Category: Article
ISSN: 0920-8542
DOI: 10.1023/a:1007985629329

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coarse grained parallel algorithms for g

Coarse grained parallel algorithms for graph matching

✍ Albert Chan; Frank Dehne; Prosenjit Bose; Markus Latzel 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 236 KB

A Randomized Parallel Three-Dimensional

A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers

✍ F. Dehne; X. Deng; P. Dymond; A. Fabri; A. A. Khokhar 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 178 KB

Parallelizing Mallat algorithm for 2-D w

Parallelizing Mallat algorithm for 2-D wavelet transforms

✍ Jian Lu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 425 KB

Parallel globally adaptive algorithms fo

Parallel globally adaptive algorithms for multi-dimensional integration

✍ J.M. Bull; T.L. Freeman 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 825 KB

Multi-dimensional parallel computing str

Multi-dimensional parallel computing structures for regular iterative algorithms

✍ Chein-Wei Jen; Ding-Ming Kwai 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 438 KB

A coarse-grained parallel QR-factorizati

A coarse-grained parallel QR-factorization algorithm for sparse least squares problems

✍ Tz. Ostromsky; P.C. Hansen; Z. Zlatev 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 599 KB

A sparse QR-factorization algorithm SPARQR for coarse-grained parallel computations is described. The coefficient matrix, which is assumed to be general sparse, is reordered in an attempt to bring as many zero elements in the lower left corner as possible. The reordered matrix is then partitioned in