Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CORR
2010
Springer

favoriteEmaildiscussreport

94views Education» more CORR 2010»

Quantization of Discrete Probability Distributions

13 years 5 months ago

Quantization of Discrete Probability Distributions

Download www.reznik.org

We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this problem can be reduced to the covering problem for the unit simplex, yielding precise characterization in the high-rate regime. Our main contribution is a simple and asymptotically optimal algorithm for solving this problem. Performance of this algorithm is studied and compared with several known solutions.

Yuriy A. Reznik

Real-time Traffic

Asymptotically Optimal Algorithm | CORR 2010 | Covering Problem | Discrete Probability Distributions | Education |

claim paper

Related Content

» Collaboration in Distributed Hypothesis Testing with Quantized Prior Probabilities

» Efficient speech recognition using subvector quantization and discretemixture HMMS

» Capacity of the DiscreteTime AWGN Channel Under Output Quantization

» Conflict in Distributed Hypothesis Testing with Quantized Prior Probabilities

» Voronoi cell shaping for feature selection with discrete HMMs

» Maximum Likelihood Quantization of Genomic Features Using Dynamic Programming

» Approximate Discrete Probability Distribution Representation Using a MultiResolution Binar...

» Automatic verification of realtime systems with discrete probability distributions

» Approximating discrete probability distributions with causal dependence trees

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Yuriy A. Reznik

Comments (0)