89 search results - page 2 / 18 » A Characterization of the Language Classes Learnable with Co... |
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...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we consider the task of answering linear queries under the constraint of differential privacy. This is a general and well-studied class of queries that captures oth...
JALC
2007
13 years 5 months ago
2007
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
ALT
1995
Springer
13 years 8 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
ALT
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we consider uncountable classes recognizable by ω-automata and investigate suitable learning paradigms for them. In particular, the counterparts of explanatory, vac...