400 search results - page 36 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
120
click to vote
ICDT
2001
ACM
15 years 4 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
119
click to vote
BIBE
2008
IEEE
15 years 6 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper pr...
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
111
click to vote
PDP
2010
IEEE
15 years 5 months ago
2010
IEEE
- We present a parallel conjugate gradient solver for the Poisson problem optimized for multi-GPU platforms. Our approach includes a novel heuristic Poisson preconditioner well sui...