Linda Sellie

14 papers A* 7B 1Journal 6
YearRankTypeTitle / Venue / Authors
2017 J jnl
Max-Throughput for (Conservative) k-of-n Testing.
Algorithmica
Lisa Hellerstein, Özgür Özkan, Linda Sellie
2012 A* conf
Tight Bounds on Proper Equivalence Query Learning of DNF.
COLT
Lisa Hellerstein, Devorah Kletenik, Linda Sellie, Rocco A. Servedio
2011 J jnl
Max-Throughput for (Conservative) k-of-n Testing
CoRR
Lisa Hellerstein, Özgür Özkan, Linda Sellie
2011 B conf
Max-Throughput for (Conservative) k-of-n Testing.
ISAAC
Lisa Hellerstein, Özgür Özkan, Linda Sellie
2011 J jnl
Tight Bounds on Proper Equivalence Query Learning of DNF
CoRR
Lisa Hellerstein, Devorah Kletenik, Linda Sellie, Rocco A. Servedio
2009 A* conf
Exact learning of random DNF over the uniform distribution.
STOC
Linda Sellie
2008 A* conf
Learning Random Monotone DNF Under the Uniform Distribution.
COLT
Linda Sellie
1997 J jnl
Efficient Learning of Typical Finite Automata from Random Walks.
Inf. Comput.
Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie
1996 J jnl
Learning Sparse Multivariate Polynomials over a Field with Queries and Counterexamples.
J. Comput. Syst. Sci.
Robert E. Schapire, Linda Sellie
1994 A* conf
On the learnability of discrete distributions.
STOC
Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie
1994 J jnl
Toward Efficient Agnostic Learning.
Mach. Learn.
Michael J. Kearns, Robert E. Schapire, Linda Sellie
1993 A* conf
Efficient learning of typical finite automata from random walks.
STOC
Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie
1993 A* conf
Learning Sparse Multivariate Polynomials over a Field with Queries and Counterexamples.
COLT
Robert E. Schapire, Linda Sellie
1992 A* conf
Toward Efficient Agnostic Learning.
COLT
Michael J. Kearns, Robert E. Schapire, Linda Sellie