Sciweavers

677 search results - page 33 / 136
» On the reconstruction of perfect codes
Sort
View
ICASSP
2008
IEEE
15 years 4 months ago
Compressed sensing with sequential observations
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of measurements. The results in the literature have focuse...
Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Wills...
ICIP
2003
IEEE
15 years 11 months ago
Redundant representation with complex wavelets: how to achieve sparsity
Overcomplete transforms, like the Dual-Tree Complex Wavelet Transform, offer more flexible signal representations than critically-sampled transforms, due to their properties of sh...
Nick G. Kingsbury, Tanya Reeves
DCC
2009
IEEE
15 years 10 months ago
An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources
We present a new lossy compressor for discrete sources. For coding a source sequence xn , the encoder starts by assigning a certain cost to each reconstruction sequence. It then f...
Shirin Jalali, Andrea Montanari, Tsachy Weissman
ICIP
1998
IEEE
15 years 11 months ago
Multiple Description Transform Coding of Images
Generalized multiple description coding (GMDC) is source coding for multiple channels such that a decoder which receives an arbitrary subset of the channels may produce a useful r...
Vivek K. Goyal, Jelena Kovacevic, Ramon Arean, Mar...
TISSEC
2002
123views more  TISSEC 2002»
14 years 9 months ago
An algebraic approach to IP traceback
We present a new solution to the problem of determining the path a packet traversed over the Internet (called the traceback problem) during a denial of service attack. Previous so...
Drew Dean, Matthew K. Franklin, Adam Stubblefield