You are currently offline. Some features of the site may not work correctly.

# 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… Expand
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
• SIAM J. Financial Math.
• 2017
• Corpus ID: 3833686
We propose an offline-online procedure for Fourier transform based option pricing. The method supports the acceleration of such… Expand
2015
2015
Abstract For a finite word w of length n we define and study the Kolmogorov structure function h w for nondeterministic automatic… Expand
2014
2014
For a finite word $$w$$ of length $$n$$ and a class of finite automata $$\mathcal A$$, we study the Kolmogorov structure function… Expand
2010
2010
• IEEE International Conference on Acoustics…
• 2010
• Corpus ID: 16326716
In a recent series of papers, it was shown how the periodogram can be smoothed by thresholding the estimated cepstral… Expand
2008
2008
• ArXiv
• 2008
• Corpus ID: 14457330
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts of… Expand
2007
2007
• Theory of Computing Systems
• 2007
• Corpus ID: 2020289
Abstract Kolmogorov complexity measures the amount of information in a string as the size of the shortest program that computes… Expand
2005
2005
• 2005
• Corpus ID: 12885778
Since the Sobolev set W r p , 0 < p < 1, in general is not contained in Lq , 0 < q ≤ ∞. We limit ourselves to the set W r p ∩ L… Expand
2005
2005
• SPIE Optics + Photonics
• 2005
• Corpus ID: 122496904
Kolmogorov's structure function (KSF) is used in the algorithmic theory of complexity for describing the structure of a string by… Expand
2002
2002
• A. McAulay
• Optics + Photonics
• 2002
• Corpus ID: 119905341
Two methods, the spectral and the covariance, are investigated and compared for generating phase screens for modeling the… Expand
Highly Cited
2001
Highly Cited
2001
• IEEE Trans. Inf. Theory
• 2001
• Corpus ID: 6742153
While Kolmogorov (1965, 1983) complexity is the accepted absolute measure of information content of an individual finite object… Expand