6105 search results - page 81 / 1221 » A Parallel Algorithm for Bound-Smoothing |
105
Voted
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
141
Voted
PLDI
2012
ACM
13 years 5 months ago
2012
ACM
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
162
click to vote
PPOPP
2012
ACM
13 years 10 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...
129
click to vote
PVLDB
2010
15 years 28 days ago
2010
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
140
Voted
CODES
2010
IEEE
15 years 17 days ago
2010
IEEE
The last years have shown that there is no way to disregard the advantages provided by multiprocessor System-on-Chip (MPSoC) architectures in the embedded systems domain. Using mu...