6105 search results - page 313 / 1221 » A Parallel Algorithm for Bound-Smoothing |
136
click to vote
EUROPAR
2009
Springer
15 years 11 months ago
2009
Springer
We demonstrate that the performance of commodity parallel systems significantly depends on low-level details, such as storage layout and iteration space mapping, which motivates t...
161
Voted
RANDOM
2001
Springer
15 years 11 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
166
click to vote
DGCI
2006
Springer
15 years 10 months ago
2006
Springer
Critical kernels constitute a general framework settled in the of abstract complexes for the study of parallel thinning in any dimension. We take advantage of the properties of thi...
188
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Phase-based methods are commonly applied in image registration. When working with phase-difference methods only a single scale is employed, although the algorithms are normally ite...
157
click to vote
MVA
1992
15 years 7 months ago
1992
This paper proposes a parallel schemelalgorithm which is based on statistical analyses to fulfilthe robust segmentation of nature texture image. The whole scheme is constructed as...