Sciweavers

314 search results - page 14 / 63
» A Comparison of Known Codes, Random Codes, and the Best Code...
Sort
View
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 8 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
CORR
2006
Springer
112views Education» more  CORR 2006»
13 years 8 months ago
Lossless coding for distributed streaming sources
Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a stream...
Cheng Chang, Stark C. Draper, Anant Sahai
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
14 years 6 days ago
Code Compaction Using Genetic Algorithms
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
Keith E. Mathias, Larry J. Eshelman, J. David Scha...
KES
2004
Springer
14 years 1 months ago
Review of Coding Techniques Applied to Remote Sensing
With the aim of obtaining a valid compression method for remote sensing and geographic information systems, and because comparisons among the different available techniques are not...
Joan Serra-Sagristà, Francesc Aulí L...
ICIP
2008
IEEE
14 years 3 months ago
Learning efficient codes for 3D face recognition
Face representation based on the Visual Codebook becomes popular because of its excellent recognition performance, in which the critical problem is how to learn the most efficien...
Cheng Zhong, Zhenan Sun, Tieniu Tan