735 search results - page 40 / 147 » Randomization in Parallel Stringology |
88
Voted
EUROPAR
2008
Springer
15 years 4 months ago
2008
Springer
This paper presents provable work-optimal parallelizations of STL (Standard Template Library) algorithms based on the workstealing technique. Unlike previous approaches where a deq...
134
Voted
PDP
2007
IEEE
15 years 8 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...
156
click to vote
PARA
2004
Springer
15 years 8 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...
121
Voted
ESTIMEDIA
2008
Springer
15 years 4 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...
108
click to vote
ICPADS
2007
IEEE
15 years 9 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 ...