Sciweavers

336 search results - page 19 / 68
» Compression of Samplable Sources
Sort
View
77
Voted
EVOW
2010
Springer
15 years 2 months ago
A Genetic Algorithm to Minimize Chromatic Entropy
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
Greg Durrett, Muriel Médard, Una-May O'Reil...
75
Voted
CORR
2006
Springer
91views Education» more  CORR 2006»
14 years 9 months ago
Universal Codes as a Basis for Time Series Testing
We suggest a new approach to hypothesis testing for ergodic and stationary processes. In contrast to standard methods, the suggested approach gives a possibility to make tests, ba...
Boris Ryabko, Jaakko Astola
SIGIR
2012
ACM
12 years 12 months ago
Optimizing positional index structures for versioned document collections
Versioned document collections are collections that contain multiple versions of each document. Important examples are Web archives, Wikipedia and other wikis, or source code and ...
Jinru He, Torsten Suel
ICASSP
2009
IEEE
15 years 4 months ago
Field inversion by consensus and compressed sensing
— We study the inversion of a random field from pointwise measurements collected by a sensor network. We assume that the field has a sparse representation in a known basis. To ...
Aurora Schmidt, José M. F. Moura
DCC
2003
IEEE
15 years 2 months ago
Rate-Distortion Bound for Joint Compression and Classification
- Rate-distortion theory is applied to the problem of joint compression and classification. A Lagrangian distortion measure is used to consider both the squared Euclidean error in ...
Yanting Dong, Lawrence Carin