3373 search results - page 142 / 675 » Linear transformations on codes |
115
Voted
CASES
2006
ACM
15 years 9 months ago
2006
ACM
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
122
click to vote
DCC
1999
IEEE
15 years 7 months ago
1999
IEEE
Abstract--Achievable distortion bounds are derived for the cascade of structured families of binary linear channel codes and binary lattice vector quantizers. It is known that for ...
142
Voted
ARTS
1999
Springer
15 years 7 months ago
1999
Springer
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Recent mo...
107
Voted
CPAIOR
2005
Springer
15 years 9 months ago
2005
Springer
Creating good integer programming formulations had, as a basic axiom, the rule “Find formulations with tighter linear relaxations”. This rule, while useful when using unsophist...
170
Voted
ESANN
2004
15 years 4 months ago
2004
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...