80 search results - page 1 / 16 » On the Learnability of Erasing Pattern Languages in the Quer... |
ALT
2003
Springer
14 years 1 months ago
2003
Springer
A pattern is a finite string of constant and variable symbols. The erasing language generated by a pattern p is the set of all strings that can be obtained by substituting (possib...
TAMC
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Formal language learning models have been widely investigated in the last four decades. But it was not until recently that the model of learning from corrections was intr...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
STOC
2000
ACM
13 years 9 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
IEICET
2008
13 years 4 months ago
2008
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...