In 1973 Kolmogorov proposed a non-probabilistic approach to statistics and model selection. Let each data be a finite binary string and models beâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- BjÃ¸rn Kjos-Hanssen
- COCOA
- 2014

For a finite word w of length n and a class of finite automata A, we study the Kolmogorov structure function hw for automaticâ€¦Â (More)

Is this relevant?

2013

2013

- Ciprian Doru Giurcaneanu, Seyed Alireza Razavi
- 2013 IEEE China Summit and Internationalâ€¦
- 2013

Cepstral nulling, one of the newest methods for smoothing the peri-odogram, amounts to turning to zero the cepstrum estimatesâ€¦Â (More)

Is this relevant?

2011

2011

- Avid Roman Gonzalez, Mihai Datcu
- 2011 IEEE International Geoscience and Remoteâ€¦
- 2011

The artifacts detection is a step of data cleaning process. The classical approach is to predict or determine the existence ofâ€¦Â (More)

Is this relevant?

2010

2010

- Ciprian Doru Giurcaneanu, Seyed Alireza Razavi
- 2010 IEEE International Conference on Acousticsâ€¦
- 2010

In a recent series of papers, it was shown how the periodogram can be smoothed by thresholding the estimated cepstralâ€¦Â (More)

Is this relevant?

2005

2005

- Peter GrÃ¼nwald, Paul M. B. VitÃ¡nyi
- ArXiv
- 2005

We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts ofâ€¦Â (More)

Is this relevant?

2003

2003

- Luis Filipe Coelho Antunes, Lance Fortnow
- Theory of Computing Systems
- 2003

Kolmogorov complexity measures the amount of information in a string as the size of the shortest program that computes the stringâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- PÃ©ter GÃ¡cs, John Tromp, Paul M. B. VitÃ¡nyi
- IEEE Trans. Information Theory
- 2001

While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarlyâ€¦Â (More)

Is this relevant?