530 search results - page 49 / 106 » Universal randomized switching |
119
click to vote
COLT
2004
Springer
15 years 9 months ago
2004
Springer
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
155
click to vote
ALT
1997
Springer
15 years 8 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...
122
click to vote
ENTCS
2006
15 years 4 months ago
2006
A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives ...
152
click to vote
IJON
2007
15 years 3 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
126
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a stream...