1686 search results - page 247 / 338 » Programs as polygraphs: computability and complexity |
171
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
136
Voted
CHI
2005
ACM
16 years 4 months ago
2005
ACM
Users of traditional tutorials and help systems often have difficulty finding the components described or pictured in the procedural instructions. Users also unintentionally miss ...
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
We study the performance of three parallel algorithms and their hybrid variants for solving tridiagonal linear systems on a GPU: cyclic reduction (CR), parallel cyclic reduction (...
136
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 28 days ago
2010
Eurographics
When projectors are used to display images on complex, non-planar surface geometry, indirect illumination between the surfaces will disrupt the final appearance of this imagery, ...
123
click to vote
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
We present an auto-tuning approach to optimize application performance on emerging multicore architectures. The methodology extends the idea of searchbased performance optimizatio...