1060 search results - page 108 / 212 » Notes on Coding Theory |
CORR
2000
Springer
14 years 9 months ago
2000
Springer
Abstract. The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory. This problem has two v...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
SIGSOFT
2005
ACM
15 years 10 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...
DCC
2005
IEEE
15 years 9 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...
IWPC
2009
IEEE
15 years 4 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...