| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Lisa Hellerstein, Devorah Kletenik |
On the gap between ess(f) and cnf_size(f).  |
ISAIM  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Lisa Hellerstein, Özgür Özkan, Linda Sellie |
Max-Throughput for (Conservative) k-of-n Testing |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Lisa Hellerstein, Devorah Kletenik, Linda Sellie, Rocco A. Servedio |
Tight Bounds on Proper Equivalence Query Learning of DNF |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Lisa Hellerstein, Devorah Kletenik |
On the gap between ess(f) and cnf_size(f) |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Lisa Hellerstein, Özgür Özkan, Linda Sellie |
Max-Throughput for (Conservative) k-of-n Testing. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Hellerstein, Bernard Rosell, Eric Bach, Soumya Ray, David Page |
Exploiting Product Distributions to Identify Relevant Variables of Correlation Immune Functions. |
Journal of Machine Learning Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu |
Algorithms for distributional and adversarial pipelined filter ordering problems. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
Pipelined filter ordering, flow algorithms, selection ordering, query optimization |
| 1 | Lisa Hellerstein, Hans-Ulrich Simon |
Special Issue: Learning Theory 2006. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks |
Minimizing Disjunctive Normal Form Formulas and AC0 Circuits Given a Truth Table. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Hellerstein |
Certificate Complexity and Exact Learning. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Amol Deshpande, Lisa Hellerstein |
Flow Algorithms for Parallel Query Optimization. |
ICDE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Hellerstein, Rocco A. Servedio |
On PAC learning algorithms for rich Boolean function classes. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu |
Flow algorithms for two pipelined filter ordering problems. |
PODS |
2006 |
DBLP DOI BibTeX RDF |
flow algorithms, pipelined filter ordering, selection ordering, query optimization |
| 1 | Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks |
Minimizing DNF Formulas and AC0d Circuits Given a Truth Table. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks |
Minimizing DNF Formulas and AC0 Circuits Given a Truth Table |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Lisa Hellerstein, Vijay Raghavan |
Exact learning of DNF formulas using DNF hypotheses. |
J. Comput. Syst. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernard Rosell, Lisa Hellerstein, Soumya Ray, David Page |
Why skewing works: learning difficult Boolean functions with greedy tree learners. |
ICML |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Marton, Ning Wu, Lisa Hellerstein |
On Compression-Based Text Classification. |
ECIR |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernard Rosell, Lisa Hellerstein |
Naïve Bayes with Higher Order Attributes. |
Canadian Conference on AI |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Hellerstein, Vijay Raghavan |
Exact learning of DNF formulas using DNF hypotheses. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
representations of boolean functions, algorithms, certificates, complexity theory, computational learning theory, disjunctive normal form, DNF |
| 1 | Lisa Hellerstein |
On generalized constraints and certificates. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Oya Ekin, Stephan Foldes, Peter L. Hammer, Lisa Hellerstein |
Equational characterizations of Boolean function classes. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph M. Hellerstein, Lisa Hellerstein, George Kollios |
On the Generation of 2-Dimensional Index Workloads. |
ICDT |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Feigelson, Lisa Hellerstein |
Conjunctions of Unate DNF Formulas: Learning and Structure. |
Inf. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard Aizenstein, Tibor Hegedüs, Lisa Hellerstein, Leonard Pitt |
Complexity Theoretic Hardness Results for Query Learning. |
Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Lisa Hellerstein |
Attribute-Efficient Learning in Query and Mistake-Bound Models. |
J. Comput. Syst. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson |
On the Power of Finite Automata with Both Nondeterministic and Probabilistic States. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Feigelson, Lisa Hellerstein |
The Forbidden Projections of Unate Functions. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins |
How Many Queries Are Needed to Learn? |
J. ACM |
1996 |
DBLP DOI BibTeX RDF |
exact identification, polynomial-query learning, polynomial-time learning, proper learning, certificates, membership queries, equivalence queries, polynomial-time hierarchy |
| 1 | Collette R. Coullard, Lisa Hellerstein |
Independence and Port Oracles for Matroids, with an Application to Computational Learning Theory. |
Combinatorica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Feigelson, Lisa Hellerstein |
Learning Conjunctions of Two Unate DNF Formulas (Extended Abstract): Computational and Informational Results. |
COLT |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Lisa Hellerstein |
Attribute-Efficient Learning in Query and Mistake-Bound Models. |
COLT |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein |
Learning Boolean Read-Once Formulas over Generalized Bases. |
J. Comput. Syst. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Lisa Hellerstein, Nick Littlestone |
Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. |
J. Comput. Syst. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein |
Learning Arithmetic Read-Once Formulas. |
SIAM J. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins |
How many queries are needed to learn? |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Hellerstein, Garth A. Gibson, Richard M. Karp, Randy H. Katz, David A. Patterson |
Coding Techniques for Handling Failures in Large Disk Arrays. |
Algorithmica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Hellerstein |
Guest Editor's Introduction. |
Machine Learning |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein, Marek Karpinski |
An Algorithm to Learn Read-Once Threshold Formulas, and Transformations Between Learning Models. |
Computational Complexity |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Hellerstein, Collette R. Coullard |
Learning Binary Matroid Ports. |
SODA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Aditi Dhagat, Lisa Hellerstein |
PAC Learning with Irrelevant Attributes |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
polynomial-time Occam algorithm, irrelevant attributes, Occam algorithm, decision lists, greedy set cover, polynomial-time, PAC learning |
| 1 | Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson |
On the power of finite automata with both nondeterministic and probabilistic states (preliminary version). |
STOC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Hellerstein |
Book Review: "Machine Learning: A Theoretical Approach". |
Machine Learning |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Angluin, Lisa Hellerstein, Marek Karpinski |
Learning Read-Once Formulas with Queries. |
J. ACM |
1993 |
DBLP DOI BibTeX RDF |
?-formulas, exact identification, polynomial-time learning, read-once formulas, interpolation, membership queries, equivalence queries |
| 1 | Lisa Hellerstein |
Functions that are Read-Once on a Subset of their Inputs. |
Discrete Applied Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein |
Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates. |
COLT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard Aizenstein, Lisa Hellerstein, Leonard Pitt |
Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
disjunctive normal, nonlearnability, polynomial-time membership, read-thrice DNF formulas, membership, boolean formulas, equivalence queries, exact learning |
| 1 | Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein |
Learning Arithmetic Read-Once Formulas |
STOC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas R. Hancock, Lisa Hellerstein |
Learning Read-Once Formulas over Fields and Extended Bases. |
COLT |
1991 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Lisa Hellerstein, Nick Littlestone |
Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. |
COLT |
1991 |
DBLP BibTeX RDF |
|
| 1 | Lisa Hellerstein, Philip N. Klein, Robert Wilber |
On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs. |
Inf. Process. Lett. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Garth A. Gibson, Lisa Hellerstein, Richard M. Karp, Randy H. Katz, David A. Patterson |
Failure Correction Techniques for Large Disk Arrays. |
ASPLOS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Hellerstein, Marek Karpinski |
Learning Read-Once Formulas Using Membership Queries. |
COLT |
1989 |
DBLP BibTeX RDF |
|
| 1 | Stephen Taylor, Lisa Hellerstein, Shmuel Safra, Ehud Y. Shapiro |
Notes on the Complexity of Systolic Programs. |
J. Parallel Distrib. Comput. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Hellerstein, Ehud Y. Shapiro |
Implementing Parallel Algorithms in Concurrent Prolog: The MAXFLOW Experience. |
J. Log. Program. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Hellerstein, Ehud Y. Shapiro |
Implementing Parallel Algorithms in Concurrent Prolog: The MAXFLOW Experience. |
SLP |
1984 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")