29 search results - page 5 / 6 » Learning Random Monotone DNF Under the Uniform Distribution |
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
TCS
2011
13 years 7 days ago
2011
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...
ALT
1997
Springer
13 years 9 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...
COLT
1992
Springer
13 years 9 months ago
1992
Springer
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Lattice-based signature schemes following the GoldreichGoldwasser-Halevi (GGH) design have the unusual property that each signature leaks information on the signer's...