6105 search results - page 241 / 1221 » A Parallel Algorithm for Bound-Smoothing |
168
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
192
click to vote
ARCS
2008
Springer
15 years 8 months ago
2008
Springer
: Sorting large data sets has always been an important application, and hence has been one of the benchmark applications on new parallel architectures. We present a parallel sortin...
182
click to vote
STTT
2011
15 years 1 months ago
2011
We present algorithms for parallel probabilistic model checking on general purpose graphic processing units (GPGPUs). Our improvements target the numerical components of the tradit...
262
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
We present an overview of our ongoing work on parallelizing self-adjusting-computation techniques. In self-adjusting computation, programs can respond to changes to their data (e....
195
click to vote
AFRICACRYPT
2010
Springer
16 years 1 months ago
2010
Springer
In this paper we present an algorithm for parallel exhaustive search for short vectors in lattices. This algorithm can be applied to a wide range of parallel computing systems. To ...