Sciweavers

1953 search results - page 88 / 391
» codes 2010
Sort
View
TIT
2010
144views Education» more  TIT 2010»
14 years 11 months ago
Lossy source compression using low-density generator matrix codes: analysis and algorithms
We study the use of low-density generator matrix (LDGM) codes for lossy compression of the Bernoulli symmetric source. First, we establish rigorous upper bounds on the average dist...
Martin J. Wainwright, Elitza N. Maneva, Emin Marti...
TSE
2010
140views more  TSE 2010»
15 years 2 months ago
Learning a Metric for Code Readability
—In this paper, we explore the concept of code readability and investigate its relation to software quality. With data collected from 120 human annotators, we derive associations...
Raymond P. L. Buse, Westley Weimer
AISC
2010
Springer
15 years 9 months ago
On Krawtchouk Transforms
Krawtchouk polynomials appear in a variety of contexts, most notably as orthogonal polynomials and in coding theory via the Krawtchouk transform. We present an operator calculus fo...
Philip Feinsilver, René Schott
ICSE
2010
IEEE-ACM
15 years 9 months ago
A degree-of-knowledge model to capture source code familiarity
The size and high rate of change of source code comprising a software system make it difficult for software developers to keep up with who on the team knows about particular parts...
Thomas Fritz, Jingwen Ou, Gail C. Murphy, Emerson ...
ICML
2010
IEEE
15 years 5 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun