701 search results - page 45 / 141 » Kolmogorov complexity in perspective |
ALT
1997
Springer
13 years 12 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
COCO
1994
Springer
13 years 11 months ago
1994
Springer
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
FINTAL
2006
13 years 11 months ago
2006
In this article, we are studying the differences between the European languages using statistical and unsupervised methods. The analysis is conducted in different levels of languag...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
If Kolmogorov complexity [25] measures information in one object and Information Distance [4, 23, 24, 42] measures information shared by two objects, how do we measure information...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...