412 search results - page 61 / 83 » New Set of Codes for the Maximum-Likelihood Decoding Problem |
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
In this paper we describe one experiment in which a new coordination language, called MANIFOLD, is used to restructure an existing sequential Fortran code from computational uid dy...
CODES
2006
IEEE
15 years 3 months ago
2006
IEEE
Lowering down the chip temperature is becoming one of the important design considerations, since temperature adversely and seriously affects many of design qualities, such as reli...
81
Voted
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
PPOPP
2005
ACM
15 years 3 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
107
click to vote
TJS
2002
14 years 9 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...