620 search results - page 20 / 124 » A Simple and Fast Min-cut Algorithm |
104
click to vote
DGCI
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The exact, subpixel watershed algorithm delivers very accurate watershed boundaries based on a spline interpolation, but is slow and only works in 2D. On the other hand, ...
106
click to vote
ISSAC
2005
Springer
15 years 7 months ago
2005
Springer
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
100
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
—Particle Swarm Optimization (PSO) has shown its fast search speed in many complicated optimization and search problems. However, PSO could often easily fall into local optima. T...
112
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In particular, Misra showed how powerlists could be use...
129
click to vote
ICDCS
2002
IEEE
15 years 6 months ago
2002
IEEE
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...