Sciweavers

6105 search results - page 281 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
PPOPP
1991
ACM
15 years 10 months ago
Coarse-Grain Parallel Programming in Jade
This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those ...
Monica S. Lam, Martin C. Rinard
ICITS
2009
15 years 4 months ago
Group Testing and Batch Verification
We observe that finding invalid signatures in batches of signatures that fail batch verification is an instance of the classical group testing problem. We present and compare new ...
Gregory M. Zaverucha, Douglas R. Stinson
182
Voted
APPROX
2009
Springer
108views Algorithms» more  APPROX 2009»
16 years 1 months ago
Strong Parallel Repetition Theorem for Free Projection Games
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen ...
CLUSTER
2006
IEEE
16 years 22 days ago
Heterogeneous Parallel Computing in Remote Sensing Applications: Current Trends and Future Perspectives
Heterogeneous networks of computers have rapidly become a very promising commodity computing solution, expected to play a major role in the design of high performance computing sy...
Antonio J. Plaza
EUROMICRO
2002
IEEE
15 years 11 months ago
Applications for the Highly Parallel Mobile Multimedia Modem M3-DSP
The Mobile Multimedia Modem (M3)-DSP is based on a scalable, highly parallel DSP platform concept capable of delivering the processing power to create software solutions for tasks...
Michael Hosemann, Gerhard Fettweis, Vladimir Nikol...