Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We propose an offline-online procedure for Fourier transform based option pricing. The method supports the acceleration of such… 
2015
2015
2014
2014
  • B. Kjos-Hanssen
  • International Conference on Combinatorial…
  • 2014
  • Corpus ID: 10995146
For a finite word \(w\) of length \(n\) and a class of finite automata \(\mathcal A\), we study the Kolmogorov structure function… 
2011
2011
The artifacts detection is a step of data cleaning process. The classical approach is to predict or determine the existence of… 
2010
2010
In a recent series of papers, it was shown how the periodogram can be smoothed by thresholding the estimated cepstral… 
2008
2007
2007
Abstract Kolmogorov complexity measures the amount of information in a string as the size of the shortest program that computes… 
2005
2005
. Since the Sobolev set W rp , 0 < p < 1, in general is not contained in L q , 0 < q ≤ ∞ , we limit ourselves to the set W rp ∩ L… 
2005
2005
Kolmogorov's structure function (KSF) is used in the algorithmic theory of complexity for describing the structure of a string by… 
Highly Cited
2000
Highly Cited
2000
While Kolmogorov (1965, 1983) complexity is the accepted absolute measure of information content of an individual finite object…