Result 1 to 20 of 92 total
When unlearning helps. (English)
Inf. Comput. 206, No. 5, 694-709 (2008).
1
Robust learning ‒ rich and poor. (English)
J. Comput. Syst. Sci. 69, No. 2, 123-165 (2004).
2
Learning all subfunctions of a function. (English)
Inf. Comput. 192, No. 2, 185-215 (2004).
3
Learning all subfunctions of a function. (English)
Schölkopf, Bernhard (ed.) et al., Learning theory and kernel machines. 16th annual conference on learning theory and 7th Kernel workshop, COLT/Kernel 2003, Washington, DC, USA, August 24‒27, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40720-0/pbk). Lect. Notes Comput. Sci. 2777, 714-728 (2003).
4
On the intrinsic complexity of learning recursive functions. (English)
Inf. Comput. 184, No.1, 45-70 (2003).
5
On learning of functions refutably. (English)
Theor. Comput. Sci. 298, No. 1, 111-143 (2003).
6
Learning all subfunctions of a function (English)
COLT, 714-728 (2003).
7
Learning by the process of elimination. (English)
Inf. Comput. 176, No.1, 37-50 (2002).
8
Learning recursive functions refutably. (English)
Abe, Naoki (ed.) et al., Algorithmic learning theory. 12th international conference, ALT 2001, Washington, DC, USA, November 25‒28, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42875-5). Lect. Notes Comput. Sci. 2225, 283-298 (2001).
9
On the role of search for learning from examples. (English)
J. Exp. Theor. Artif. Intell. 13, No. 1, 25-43 (2001).
10
Robust learning ‒ rich and poor. (English)
Helmbold, David (ed.) et al., Computational learning theory. 14th annual conference, COLT 2001, and 5th European conference, EuroCOLT 2001, Amsterdam, Netherlands, July 16-19, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2111, 143-159 (2001).
11
Language learning from texts: Degrees of intrinsic complexity and their characterizations. (English)
J. Comput. Syst. Sci. 63, No.3, 305-354 (2001).
12
Special issue: Algorithmic learning theory. Selected papers from the ninth international conference (ALT ’98), EBZ Otzenhausen, Germany, October 8‒10 1998. (English)
Theor. Comput. Sci. 268, No.2, 175-396 (2001).
13
Robust learning is rich. (English)
J. Comput. Syst. Sci. 62, No.1, 178-212 (2001).
14
On the role of search for learning from examples (English)
J. Exp. Theor. Artif. Intell. 13, No. 1, 25-43 (2001).
15
Learning recursive functions refutably (English)
ALT, 283-298 (2001).
16
Robust learning - rich and poor (English)
COLT/EuroCOLT, 143-159 (2001).
17
Learning languages and functions by erasing. (English)
Theor. Comput. Sci. 241, No.1-2, 143-189 (2000).
18
Language learning from texts: degrees of instrinsic complexity and their characterizations (English)
COLT, 47-58 (2000).
19
On the intrinsic complexity of learning recursive functions (English)
COLT, 257-266 (1999).
20
Result 1 to 20 of 92 total
Start
Contact
Print
General Help
