Linda Sellie

According to our database, Linda Sellie authored at least 8 papers between 1994 and 2017.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2017

Max-Throughput for (Conservative) k-of-n Testing.

Lisa Hellerstein, Özgür Özkan, Linda Sellie

Algorithmica, 2017

2012

Tight Bounds on Proper Equivalence Query Learning of DNF.

Lisa Hellerstein, Devorah Kletenik, Linda Sellie, Rocco A. Servedio

Proceedings of the COLT 2012, 2012

2009

Exact learning of random DNF over the uniform distribution.

Linda Sellie

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

Learning Random Monotone DNF Under the Uniform Distribution.

Linda Sellie

Proceedings of the 21st Annual Conference on Learning Theory, 2008

1997

Efficient Learning of Typical Finite Automata from Random Walks.

Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie

Inf. Comput., 1997

1996

Learning Sparse Multivariate Polynomials over a Field with Queries and Counterexamples.

Robert E. Schapire, Linda Sellie

J. Comput. Syst. Sci., 1996

1994

Toward Efficient Agnostic Learning.

Michael J. Kearns, Robert E. Schapire, Linda Sellie

Mach. Learn., 1994

On the learnability of discrete distributions.

Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994