5056 search results - page 316 / 1012 » Network Coding Theory |
128
click to vote
SIGSOFT
2005
ACM
16 years 4 months ago
2005
ACM
We present Arithmetic Program Paths, a novel, efficient way to compress program control-flow traces that reduces program bit traces to less than a fifth of their original size whi...
142
click to vote
DCC
2005
IEEE
16 years 3 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
118
click to vote
IWPC
2009
IEEE
15 years 10 months ago
2009
IEEE
Comprehending an unfamiliar code fragment requires an awareness of explicit usage directives that may be present in the documentation of some invoked functions. Since it is not pr...
115
click to vote
ECOOP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In many domains, classes have highly regular internal structure. For example, so-called business objects often contain boilerplate code for mapping database fields to cl...
138
click to vote
LCTRTS
2005
Springer
15 years 9 months ago
2005
Springer
The limited built-in configurability of Linux can lead to expensive code size overhead when it is used in the embedded market. To overcome this problem, we propose the applicatio...