Sciweavers

4355 search results - page 5 / 871
» Increasing Kolmogorov Complexity
Sort
View
CIE
2006
Springer
14 years 9 days ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
DAGSTUHL
2006
13 years 10 months ago
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence fo
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...
Boris Ryabko, Jaakko Astola, Alexander Gammerman
HCI
2007
13 years 10 months ago
An Epileptic Seizure Prediction Algorithm from Scalp EEG Based on Morphological Filter and Kolmogorov Complexity
Epilepsy is the most common neurological disorder in the world, second only to stroke. There are nearly 15 million patients suffer from refractory epilepsy, with no available ther...
Guanghua Xu, Jing Wang, Qing Zhang, Junming Zhu
CIE
2011
Springer
12 years 8 months ago
Towards an Axiomatic System for Kolmogorov Complexity
Abstract. In [She82], it is shown that four of its basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization...
Antoine Taveneaux
CAE
2007
13 years 11 months ago
Conceptualizing Birkhoff's Aesthetic Measure Using Shannon Entropy and Kolmogorov Complexity
In 1928, George D. Birkhoff introduced the Aesthetic Measure, defined as the ratio between order and complexity, and, in 1965, Max Bense analyzed Birkhoff's measure from an i...
Jaume Rigau, Miquel Feixas, Mateu Sbert