DocumentCode
2526838
Title
A parallel partial-sums computation on a pyramid machine
Author
Cinque, Luigi
Author_Institution
Dipartimento di Sci. dell´´Inf., Rome Univ., Italy
Volume
4
fYear
1996
fDate
25-29 Aug 1996
Firstpage
616
Abstract
A computationally efficient solution to the partial-sums problem is given on a pyramid computer. The algorithm is optimal, since for n elements it requires O(n/lg n) processors and O(lg n) time (excluding the time to load the image)
Keywords
computational complexity; computer vision; parallel algorithms; parallel machines; computer vision; image processing; optimal algorithm; parallel partial-sums; parallel processing; pyramid machine; time complexity; Concurrent computing; Geometry; High performance computing; Humans; Image processing; Remuneration; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 1996., Proceedings of the 13th International Conference on
Conference_Location
Vienna
ISSN
1051-4651
Print_ISBN
0-8186-7282-X
Type
conf
DOI
10.1109/ICPR.1996.547638
Filename
547638
Link To Document