6129 search results - page 51 / 1226 » A parallel LLL algorithm |
102
click to vote
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 ...
138
Voted
PLDI
2012
ACM
13 years 4 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...
158
Voted
PPOPP
2012
ACM
13 years 9 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...
144
click to vote
ANCS
2009
ACM
15 years 6 hour ago
2009
ACM
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
120
click to vote
IPPS
2002
IEEE
15 years 7 months ago
2002
IEEE
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...