13 search results - page 1 / 3 » Simple DFA are Polynomially Probably Exactly Learnable from ... |
ICML
1999
IEEE
14 years 5 months ago
1999
IEEE
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
ALT
1997
Springer
13 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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
COCO
2001
Springer
13 years 8 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
CSDA
2004
13 years 4 months ago
2004
Various exact tests for showing a difference between two treatments or the noninferiority (therapeutic equivalence) based on the difference of two binomial proportions are compare...