✦ LIBER ✦

Solving tree problems on a mesh-connected processor array

✍ Scribed by Mikhail J. Atallah; Susanne E. Hambrusch

Book ID: 114037786
Publisher: Elsevier Science
Year: 1986
Weight: 963 KB
Volume: 69
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(86)80046-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast hough transform on a mesh connected

Fast hough transform on a mesh connected processor array

✍ C.S. Kannan; Henry Y.H. Chuang 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 581 KB

Parallel image normalization on a mesh c

Parallel image normalization on a mesh connected array processor

✍ S.-Y. Lee; S. Yalamanchili; J.K. Aggarwal 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 645 KB

Integer sorting on a mesh-connected arra

Integer sorting on a mesh-connected array of processors

✍ Danny Krizanc 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 649 KB

Term matching on a mesh-connected array

Term matching on a mesh-connected array of processors

✍ Arthur L. Delcher; Simon Kasif 📂 Article 📅 1995 🏛 Springer Netherlands 🌐 English ⚖ 498 KB

Parallel B-Spline Surface Interpolation

Parallel B-Spline Surface Interpolation on a Mesh-Connected Processor Array

✍ F.H. Cheng; G.W. Wasilkowski; J.Y. Wang; C.M. Zhang; W.P. Wang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 422 KB

A parallel implementation of Chebyshev method is presented for the B-spline surface interpolation problem. The algorithm finds the control points of a uniform bicubic B-spline surface that interpolates \(m \times n\) data points on an \(m \times n\) mesh-connected processor array in constant time. H

Time lower bounds for parallel sorting o

Time lower bounds for parallel sorting on a mesh-connected processor array

✍ Yijie Han; Yoshihide Igarashi 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 549 KB