Optimal parallel analysis and decomposition of partially occluded strings

Authors
Iliopoulos, CS Reid, JF
Citation
Cs. Iliopoulos et Jf. Reid, Optimal parallel analysis and decomposition of partially occluded strings, PARALLEL C, 26(4), 2000, pp. 483-494
Citations number
17
Categorie Soggetti
Computer Science & Engineering
Journal title
PARALLEL COMPUTING
ISSN journal
01678191 → ACNP
Volume
26
Issue
4
Year of publication
2000
Pages
483 - 494
Database
ISI
SICI code
0167-8191(200003)26:4<483:OPAADO>2.0.ZU;2-X
Abstract
This is a theoretical study of partially occluded one-dimensional images. H ere, we consider ''valid" images composed from a given set of objects, wher e 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 O(log logn) time with linear work, where k is a fixed integer. (C) 2000 Published by El sevier Science B.V. All rights reserved.