Sciweavers

911 search results - page 22 / 183
» Kolmogorov Complexity Cores
Sort
View
CORR
2006
Springer
88views Education» more  CORR 2006»
15 years 1 months ago
The Power and Perils of MDL
Practical use of MDL is full of pitfalls in which the practitioners tend to fall head over heels. We analyse the power and the perils in the use of MDL. Generally, the classical a...
Pieter W. Adriaans, Paul M. B. Vitányi
IPL
2007
100views more  IPL 2007»
15 years 1 months ago
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
Brendan Lucier, Tao Jiang, Ming Li
TAMC
2010
Springer
15 years 7 months ago
Community Structure in Large Complex Networks
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
Liaoruo Wang, John E. Hopcroft
TCSV
2002
99views more  TCSV 2002»
15 years 1 months ago
Embedded coring in MPEG video compression
Coring is a well-known technique for removing noise from images. The mechanism of coring consists of transforming a noise-degraded image into a frequency-domain representation, fol...
Peter M. B. van Roosmalen, Reginald L. Lagendijk, ...
CORR
2000
Springer
116views Education» more  CORR 2000»
15 years 1 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...