𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An asynchronous thinning algorithm

✍ Scribed by Theo Pavlidis


Publisher
Elsevier Science
Year
1982
Weight
83 KB
Volume
19
Category
Article
ISSN
0146-664X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


An efficient distributed thinning algori
✍ Christian Neusius; Jan Olszewski; Dieter Scheerer πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 556 KB
An asynchronous parallel branch-and-boun
✍ Tsuyoshi Kawaguchi; Hiroshi Masuyama; Tamotsu Maeda πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 975 KB

## Abstract This paper presents a parallel branch‐and‐bound algorithm which is applicable to a loosely coupled multiprocessor with nonhierarchical interconnection network such as torus or hypercube. This algorithm is asynchronous and processing elements (PEs) start evaluation of nodes without being

A knowledge-based thinning algorithm
✍ Bei Li; Ching Y Suen πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 620 KB
A pattern adaptive thinning algorithm
✍ V.K. Govindan; A.P. Shivaprasad πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 820 KB