39 search results - page 1 / 8 » Universality of Serial Histograms |
VLDB
1993
ACM
13 years 9 months ago
1993
ACM
TCOM
2008
13 years 5 months ago
2008
In this paper, we propose serially concatenated trellis coded modulations (SCTCMs) that perform consistently close to the available mutual information for periodic erasure channel...
DAGSTUHL
2006
13 years 6 months ago
2006
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...
GLOBECOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— In this paper, we propose serially concatenated trellis coded modulations (SCTCMs) that perform consistently close to the available mutual information for the 2-by-2 compound m...
CVPR
2009
IEEE
15 years 16 days ago
2009
IEEE
Establishing visual correspondences is an essential component
of many computer vision problems, and is often done
with robust, local feature-descriptors. Transmission and
storag...