148 search results - page 3 / 30 » Exploiting Parallelism for Hard Problems in Abstract Argumen... |
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
ISHPC
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
VLDB
1995
ACM
13 years 11 months ago
1995
ACM
Abstract: Intra-operator(or partitioned) parallelism is a well-established mechanism for achieving high performance in parallel database systems. However, the problem of how to exp...
IEEEPACT
2008
IEEE
14 years 1 months ago
2008
IEEE
The memory access limits the performance of stream processors. By exploiting the reuse of data held in the Stream Register File (SRF), an on-chip storage, the number of memory acc...
CONCUR
2004
Springer
14 years 26 days ago
2004
Springer
Systems (extended abstract) Simona Orzan and Tim A.C. Willemse Department of Mathematics and Computer Science, Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, T...