Sciweavers

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

9

STOC
2002
ACM

favoriteEmaildiscussreport

105views Algorithms» more STOC 2002»

Approximating the smallest grammar: Kolmogorov complexity in natural models

14 years 4 months ago

Approximating the smallest grammar: Kolmogorov complexity in natural models

Download www.cs.princeton.edu

Moses Charikar, Eric Lehman, Ding Liu, Rina Panigr

Real-time Traffic

Algorithms | Kolmogorov Complexity | STOC 2002 |

claim paper

Related Content

» Approximating ContextFree Grammars with a FiniteState Calculus

» Incremental Sigmoid Belief Networks for Grammar Learning

» Quantitative Comparison of Languages

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2002
Where	STOC
Authors	Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, Abhi Shelat

Comments (0)