1855 search results - page 251 / 371 » A coding theorem for distributed computation |
113
click to vote
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
This paper addresses the problem of extracting coarse-grained parallelism from large sequential code. It builds on BOP, a system for software speculative parallelization. BOP lets...
127
click to vote
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
Transactional memory promises to make parallel programming easier than with fine-grained locking, while performing just as well. This performance claim is not always borne out bec...
114
Voted
EUROPAR
2007
Springer
15 years 10 months ago
2007
Springer
1 Future gain in computing performance will not stem from increased clock rates, but from even more cores in a processor. Since automatic parallelization is still limited to easily...
117
click to vote
ECEASST
2010
15 years 1 months ago
2010
: For years, one of the main reasons to buy commercial software instead of adopting open-source applications was the, supposed, guarantee of quality. Unfortunately that was rarely ...
143
click to vote
SIGGRAPH
1999
ACM
15 years 8 months ago
1999
ACM
We introduce a method for predicting a control signal from another related signal, and apply it to voice puppetry: Generating full facial animation from expressive information in ...