6105 search results - page 902 / 1221 » A Parallel Algorithm for Bound-Smoothing |
184
click to vote
ESTIMEDIA
2007
Springer
16 years 26 days ago
2007
Springer
—Modern compression standards such as H.264, DivX, or VC-1 provide astonishing quality at the costs of steadily increasing processing requirements. Therefore, efficient solution...
189
click to vote
SPAA
2004
ACM
16 years 3 days ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
163
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
Microprocessors are today getting more and more inefficient for a growing range of applications. Its principles -The Von Neumann paradigm[3]- based on the sequential execution of ...
203
click to vote
IJHPCA
2007
15 years 6 months ago
2007
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...
183
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...