1855 search results - page 215 / 371 » A coding theorem for distributed computation |
166
click to vote
ICS
1995
Tsinghua U.
15 years 10 months ago
1995
Tsinghua U.
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
201
click to vote
ICPP
1991
IEEE
15 years 9 months ago
1991
IEEE
Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel...
210
click to vote
PPOPP
1991
ACM
15 years 9 months ago
1991
ACM
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 ...
187
click to vote
SIGSOFT
2007
ACM
16 years 7 months ago
2007
ACM
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
177
click to vote
MIR
2010
ACM
16 years 1 months ago
2010
ACM
Sparse coding is a key principle that underlies wavelet representation of natural images. In this paper, we explain that the effort of seeking a common wavelet sparse coding of i...