Sciweavers

677 search results - page 58 / 136
» On the reconstruction of perfect codes
Sort
View
ICIP
1998
IEEE
15 years 2 months ago
Implicit Coding for Very Low Bit Rate Image Compression
W e explore a n image compression scheme that does not rely o n the usual additive decomposition of a n input image into a set of predefined spanning functions. The proposed schem...
Yuk-Wong Choi, Nguyen T. Thao
CORR
2010
Springer
108views Education» more  CORR 2010»
14 years 9 months ago
Generalized Secure Distributed Source Coding with Side Information
In this paper, new inner and outer bounds on the achievable compression-equivocation rate region for generalized secure data compression with side information are given that do not...
Somayeh Salimi, Mahmoud Salmasizadeh, Mohammad Rez...
SOFTVIS
2005
ACM
15 years 3 months ago
Visualizing multiple evolution metrics
Observing the evolution of very large software systems is difficult because of the sheer amount of information that needs to be analyzed and because the changes performed in the s...
Martin Pinzger, Harald Gall, Michael Fischer, Mich...
CISS
2007
IEEE
15 years 4 months ago
Differential Space-Frequency Group Codes for MIMO-OFDM
— In recent years, coherent space-frequency (SF) coded multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems have attracted great attentio...
Engin Zeydan, Ufuk Tureli
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 3 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith