164 search results - page 9 / 33 » The Kolmogorov complexity of random reals |
ALT
1997
Springer
13 years 11 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...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
FSTTCS
1992
Springer
13 years 11 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
— Designing algorithms for multi-robot systems can be a complex and difficult process: the cost of such systems can be very high, collecting experimental data can be timeconsumi...
MEDIAFORENSICS
2010
13 years 8 months ago
2010
In this paper, we consider a low complexity identification system for highly distorted images. The performance of the proposed identification system is analyzed based on the avera...