874 search results - page 47 / 175 » Practical Algorithms for Selection on Coarse-Grained Paralle... |
WSC
2004
13 years 11 months ago
2004
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...
PPOPP
2012
ACM
12 years 5 months ago
2012
ACM
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be bui...
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
AFRICACRYPT
2010
Springer
14 years 5 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 ...
IEEEPACT
2007
IEEE
14 years 4 months ago
2007
IEEE
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...