Kolmogorov structure function

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)
Wikipedia

Topic mentions per year

Topic mentions per year

2001-2013
0120012013

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
Cepstral nulling, one of the newest methods for smoothing the peri-odogram, amounts to turning to zero the cepstrum estimates… (More)
  • table 1
Is this relevant?
2011
2011
The artifacts detection is a step of data cleaning process. The classical approach is to predict or determine the existence of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
In a recent series of papers, it was shown how the periodogram can be smoothed by thresholding the estimated cepstral… (More)
  • figure 1
Is this relevant?
2005
2005
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts of… (More)
  • figure 1
  • figure 2
Is this relevant?
2003
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
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly… (More)
  • figure 1
Is this relevant?