Sciweavers

1245 search results - page 63 / 249
» Binary Sparse Coding
Sort
View
94
Voted
DCC
2001
IEEE
16 years 2 months ago
Trellis Structure and Higher Weights of Extremal Self-Dual Codes
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
Houshou Chen, John T. Coffey
DCC
2000
IEEE
15 years 6 months ago
The Skip-Innovation Model for Sparse Images
On sparse images, contiguous runs of identical symbols often occur in the same coding context. This paper proposes a model for efficiently encoding such runs in a twodimensional s...
Paul J. Ausbeck Jr.
MIR
2010
ACM
229views Multimedia» more  MIR 2010»
15 years 9 months ago
Wavelet, active basis, and shape script: a tour in the sparse land
Sparse coding is a key principle that underlies wavelet representation of natural images. In this paper, we explain that the effort of seeking a common wavelet sparse coding of i...
Zhangzhang Si, Ying Nian Wu
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
14 years 2 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
NIPS
2007
15 years 3 months ago
The Generalized FITC Approximation
We present an efficient generalization of the sparse pseudo-input Gaussian process (SPGP) model developed by Snelson and Ghahramani [1], applying it to binary classification pro...
Andrew Naish-Guzman, Sean B. Holden