1534 search results - page 118 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
180
click to vote
IPPS
2010
IEEE
15 years 3 months ago
2010
IEEE
Many large-scale clusters now have hundreds of thousands of processors, and processor counts will be over one million within a few years. Computational scientists must scale their ...
237
click to vote
SC
2000
ACM
15 years 10 months ago
2000
ACM
We aimed to study the performance of a parallel implementation of an intraoperative nonrigid registration algorithm that accurately simulates the biomechanical properties of the b...
177
click to vote
IPPS
2006
IEEE
15 years 12 months ago
2006
IEEE
In this paper we revisit the tile-shape selection problem, that has been extensively discussed in bibliography. An efficient approach is proposed for the selection of a suitable t...
154
click to vote
FOCS
2008
IEEE
16 years 13 days ago
2008
IEEE
The parallel repetition theorem states that for any two-prover game, with value 1 − (for, say, ≤ 1/2), the value of the game repeated in parallel n times is at most (1 − c)â...
153
click to vote
CCS
2004
ACM
15 years 11 months ago
2004
ACM
Efforts to design faster synchronous mix networks have focused on reducing the computational cost of mixing per server. We propose a different approach: our re-encryption mixnet...