1720 search results - page 84 / 344 » Unranking Combinations in Parallel |
124
Voted
IEEESCC
2007
IEEE
15 years 10 months ago
2007
IEEE
A common pattern in scientific computing involves the execution of many tasks that are coupled only in the sense that the output of one may be passed as input to one or more other...
157
Voted
ASPLOS
2010
ACM
15 years 8 months ago
2010
ACM
Heterogeneous computing combines general purpose CPUs with accelerators to efficiently execute both sequential control-intensive and data-parallel phases of applications. Existin...
138
Voted
PPSC
1993
15 years 5 months ago
1993
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solvee ectively on massivelyparallel machines. Rather than trying to design a black box" ...
138
Voted
ALGORITHMICA
2005
15 years 3 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
122
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...