Optimal parallel analysis and decomposition of partially occluded strings
โ Scribed by Costas S. Iliopoulos; James F. Reid
- Book ID
- 104304809
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 144 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
โฆ Synopsis
This is a theoretical study of partially occluded one-dimensional images. Here, we consider ``valid'' images composed from a given set of objects, where some objects appearing in the image may be partially obstructed by others. A CRCW PRAM algorithm is presented here for validating a one-dimensional image x of length n over a set of k objects of equal length in Olog log n time with linear work, where k is a ยฎxed integer.
๐ SIMILAR VOLUMES
Heydorn, S. and P. Weidner, Optimization and performance analysis of thinning algorithms on parallel computers, Parallel Computing 17 (1991) 17-27. This paper presents a concept for an implementation of different parallel thinning algorithms on parallel processors. The emphasis is put on a good para