3047 search results - page 113 / 610 » Randomized Parallel Selection |
PDP
2007
IEEE
14 years 4 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
PARA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
ESTIMEDIA
2008
Springer
13 years 12 months ago
2008
Springer
Markov random field models provide a robust formulation of low-level vision problems. Among the problems, stereo vision remains the most investigated field. The belief propagation...
JPDC
2010
13 years 5 months ago
2010
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the ...
ICPADS
2007
IEEE
14 years 4 months ago
2007
IEEE
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling ...