911 search results - page 46 / 183 » Kolmogorov Complexity Cores |
182
click to vote
ALT
1997
Springer
15 years 10 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...
149
click to vote
COCO
1994
Springer
15 years 10 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...
144
click to vote
FINTAL
2006
15 years 9 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...
162
click to vote
SODA
2003
ACM
15 years 7 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...
125
click to vote
APAL
2008
15 years 6 months ago
2008
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...