A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The optimal All-Partial-Sums algorithm in commutative semigroups and its applications for image thresholding segmentation

2011
*
Theoretical Computer Science
*

The design and analysis of multidimensional All-Partial-Sums (APS) algorithms are considered. We employ the sequence length as the performance measurement criterion for APS algorithms and corresponding thresholding methods, which is more sophisticated than asymptotic time complexity under the straight-line program computation model. With this criterion, we propose the piling algorithm to minimize the sequence length, then we show this algorithm is an optimal APS algorithm in commutative

doi:10.1016/j.tcs.2010.11.039
fatcat:hpco5ic3njbmxh6izo625qjyym