no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Agnostic active learning
|
Balcan, Maria-Florina |
|
2009 |
75 |
1 |
p. 78-89 12 p. |
article |
2 |
Contents
|
|
|
2009 |
75 |
1 |
p. OBC- 1 p. |
article |
3 |
Cryptographic hardness for learning intersections of halfspaces
|
Klivans, Adam R. |
|
2009 |
75 |
1 |
p. 2-12 11 p. |
article |
4 |
Editorial Board
|
|
|
2009 |
75 |
1 |
p. IFC- 1 p. |
article |
5 |
Efficient learning algorithms yield circuit lower bounds
|
Fortnow, Lance |
|
2009 |
75 |
1 |
p. 27-36 10 p. |
article |
6 |
Hardness of approximate two-level logic minimization and PAC learning with membership queries
|
Feldman, Vitaly |
|
2009 |
75 |
1 |
p. 13-26 14 p. |
article |
7 |
Learning a circuit by injecting values
|
Angluin, Dana |
|
2009 |
75 |
1 |
p. 60-77 18 p. |
article |
8 |
Shifting: One-inclusion mistake bounds and sample compression
|
Rubinstein, Benjamin I.P. |
|
2009 |
75 |
1 |
p. 37-59 23 p. |
article |
9 |
Special Issue: Learning Theory 2006
|
Hellerstein, Lisa |
|
2009 |
75 |
1 |
p. 1- 1 p. |
article |