𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel structural optimization method and its implementation on a Transtech Paramid

✍ Scribed by Xicheng Wang; F.W. Williams; D. Kennedy

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
881 KB
Volume
135
Category
Article
ISSN
0045-7825

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel shape recognition and its imple
Parallel shape recognition and its implementation on a fixed-size VLSI architecture
✍ H.D. Cheng; X. Cheng πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 928 KB

Shape recognition is an important research area in pattern recognition. It also has wide practical applications in many fields. An attribute grammar approach to shape recognition combines both advantages of syntactic and statistical methods and makes shape recognition more accurate and efficient. Ho

Parallel Sorting Algorithm Using Multiwa
Parallel Sorting Algorithm Using Multiway Merge and Its Implementation on a Multi-Mesh Network
✍ Bhabani P. Sinha; Amar Mukherjee πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 288 KB

In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This algorithm, when implemented on a t dimensional mesh having n t nodes (t>2), sorts n t elements in O((t 2 &3t+2) n) time, thus offering a better order of time complexity than the [((t 2 &t) n log n)Γ‚2+

A Faster Implementation of a Parallel Tr
A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs
✍ Sun-yuan Hsieh; Chin-Wen Ho; Tsan-sheng Hsu; Ming-Tat Ko; Gen-Huey Chen πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 261 KB

We consider a parallel tree contraction scheme which in each contraction phase Ε½ . Ε½ . removes leaves and nodes in the maximal chains. Let T n and P n denote the time and processor complexity required to compute the all nearest smaller values Ε½ . ANSV and the minimum of n values for input elements d