Sciweavers

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

5

STOC
2002
ACM

favoriteEmaildiscussreport

119views Algorithms» more STOC 2002»

The complexity of approximating entropy

14 years 5 months ago

The complexity of approximating entropy

Download www.maths.lse.ac.uk

Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt R

Real-time Traffic

Algorithms | STOC 2002 |

claim paper

Related Content

» Approximate Entropy Reducts

» On Approximating the Entropy of Polynomial Mappings

» Minimax Mutual Information Approach for ICA of ComplexValued Linear Mixtures

» Computing Entropy for Ortholog Detection

» On Linear Cryptanalysis with Many Linear Approximations

» Dimension Entropy Rates and Compression

» A General LongTime Molecular Dynamics Scheme in Atomistic Systems Hyperdynamics in Entropy...

» Towards Practical MinimumEntropy Universal Decoding

» Approximate analysis of blocking queueing networks with temporal dependence

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2002
Where	STOC
Authors	Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld

Comments (0)