Leonard Pitt

发表

A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graphs

Leonard Pitt, 1987, Inf. Process. Lett..

Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries

Leonard Pitt, Carlos Domingo, Nina Mishra, 1999, Machine Learning.

Michael Frazier, Leonard Pitt, Dana Angluin, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Learning from a consistently ignorant teacher

Michael Frazier, Leonard Pitt, Nina Mishra, 1994, COLT '94.

Optimized disjunctive association rules via sampling

Leonard Pitt, Joseph Elble, Cinda Heeren, 2003, Third IEEE International Conference on Data Mining.

Introduction: Special Issue on Computational Learning Theory

Leonard Pitt, 2005, Machine Learning.

Criteria for polynomial-time (conceptual) clustering

Leonard Pitt, Robert E. Reinke, 2004, Machine Learning.

Generating all maximal independent sets of bounded-degree hypergraphs

Leonard Pitt, Nina Mishra, 1997, COLT '97.

Relations between probabilistic and team one-shot learners (extended abstract)

Leonard Pitt, Robert P. Daley, Mahendran Velauthapillai, 1991, COLT '91.

Semi-supervised learning

Leonard Pitt, Raymond A. Board, L. Pitt, 2004, Machine Learning.

Maximal boasting

Leonard Pitt, Cinda Heeren, 2005, KDD '05.

Probabilistic inductive inference

Leonard Pitt, L. Pitt, 1989, JACM.

Version Spaces without Boundary Sets

Leonard Pitt, Haym Hirsh, Nina Mishra, 1997, AAAI/IAAI.

Some new directions in computational learning theory

Michael Frazier, Leonard Pitt, 1994 .

A polynomial-time algorithm for learning k-variable pattern languages from examples

Leonard Pitt, Michael Kearns, M. Kearns, 1989, COLT '89.

Learning When to Trust Which Experts

Stephen Kwek, Leonard Pitt, David P. Helmbold, 1997, EuroCOLT.

The minimum consistent DFA problem cannot be approximated within any polynomial

Leonard Pitt, Manfred K. Warmuth, 1993, JACM.

Learning From Entailment: An Application to Propositional Horn Sentences

Michael Frazier, Leonard Pitt, 1993, ICML.

A bounded approximation for the minimum cost 2-sat problem

Leonard Pitt, Dan Gusfield, L. Pitt, 1992, Algorithmica.

Reductions among prediction problems: on the difficulty of predicting automata

Leonard Pitt, Manfred K. Warmuth, L. Pitt, 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

Learning conjunctions of Horn clauses

Michael Frazier, Leonard Pitt, Dana Angluin, 2004, Machine Learning.

Prediction-Preserving Reducibility

Leonard Pitt, Manfred K. Warmuth, L. Pitt, 1990, J. Comput. Syst. Sci..

On learning Read-k-Satisfy-j DNF

Eyal Kushilevitz, Leonard Pitt, Dan Roth, 1994, COLT '94.

Complexity theoretic hardness results for query learning

Lisa Hellerstein, Leonard Pitt, Howard Aizenstein, 1998, computational complexity.

Learning from a Consistently Ignorant Teacher

Michael Frazier, Leonard Pitt, Nina Mishra, 1996, J. Comput. Syst. Sci..

Selected papers of the 23rd annual ACM symposium on Theory of computing

Joan Feigenbaum, Baruch Awerbuch, Leonard Pitt, 1995 .

Proceedings of the 1988 Workshop on Computational Learning Theory : MIT, August 3-5, 1988

David Haussler, Leonard Pitt, 1989 .

Optimization problems in data mining

Leonard Pitt, Cinda Heeren, 2004 .

On the necessity of Occam algorithms

Leonard Pitt, Raymond A. Board, L. Pitt, 1990, STOC '90.

On the Necessity of Occam Algorithms

Leonard Pitt, Raymond A. Board, 1992, Theor. Comput. Sci..

The minimum consistent DFA problem cannot be approximated within and polynomial

Leonard Pitt, Manfred K. Warmuth, L. Pitt, 1989, STOC '89.

On Exploiting Knowledge and Concept Use in Learning Theory

Leonard Pitt, L. Pitt, 1997, ALT.

CLASSIC Learning

Michael Frazier, Leonard Pitt, 1994, COLT.

Introduction: Special issue on computational learning theory

Leonard Pitt, 2004, Machine Learning.

Learning Conjunctions of Horn Clauses**An extended abstract of this paper appears in Proceedings of the 31st Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1990.

Michael Frazier, Leonard Pitt, Dana Angluin, 1990 .

Probability and Plurality for Aggregations of Learning Machines

Carl H. Smith, Leonard Pitt, L. Pitt, 1987, Inf. Comput..

Optimal indexing using near-minimal space

Leonard Pitt, H. V. Jagadish, Cinda Heeren, 2003, PODS '03.

Equivalent Approximation Algorithms for Node Cover

Leonard Pitt, Dan Gusfield, L. Pitt, 1986, Inf. Process. Lett..

PAC learning intersections of halfspaces with membership queries (extended abstract)

Stephen Kwek, Leonard Pitt, L. Pitt, 1996, COLT '96.

On Learning Read-k-Satisfy-j DNF

Eyal Kushilevitz, Leonard Pitt, Dan Roth, 1998, SIAM J. Comput..

Sublinear time approximate clustering

Leonard Pitt, Nina Mishra, Daniel Oblinger, 2001, SODA '01.

On the learnability of disjunctive normal form formulas

Leonard Pitt, Howard Aizenstein, L. Pitt, 2004, Machine Learning.

A Characterization of Probabilistic Inference

Leonard Pitt, L. Pitt, 1984, FOCS.

Probability and Plurality for Aggregations of Learning Machines

Carl H. Smith, Leonard Pitt, 1988, Inf. Comput..

Computational limitations on learning from examples

Leslie G. Valiant, Leonard Pitt, L. Pitt, 1988, JACM.

Read-thrice DNF is hard to learn with membership and equivalence queries

Lisa Hellerstein, Leonard Pitt, Howard Aizenstein, 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

Classic Learning

Michael Frazier, Leonard Pitt, 1996, Mach. Learn..

Exact learning of read-k disjoint DNF and not-so-disjoint DNF

Leonard Pitt, Howard Aizenstein, 1992, COLT '92.

Version spaces and the consistency problem

Leonard Pitt, Haym Hirsh, Nina Mishra, 2004, Artif. Intell..

Learning Conjunctions of Horn Clauses (Extended Abstract)

Michael Frazier, Leonard Pitt, Dana Angluin, 1990, FOCS 1990.

On the learnability of Boolean formulae

Leslie G. Valiant, Leonard Pitt, Ming Li, 1987, STOC.

The minimum consistent DFA problem cannot be approximated within any polynomial

Leonard Pitt, Manfred K. Warmuth, L. Pitt, 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

Learning conjunctions of horn clauses (abstract)

Michael Frazier, Leonard Pitt, Dana Angluin, 1990, COLT '90.

Inductive Inference, DFAs, and Computational Complexity

Leonard Pitt, L. Pitt, 1989, AII.

Classic learning

Michael Frazier, Leonard Pitt, L. Pitt, 1994, COLT '94.

PAC Learning Intersections of Halfspaces with Membership Queries

Stephen Kwek, Leonard Pitt, L. Pitt, 1998, Algorithmica.

Criteria for Polynomial-Time (Conceptual) Clustering

Leonard Pitt, Robert E. Reinke, L. Pitt, 1988, Machine Learning.

The Decline of the Californios: A Social History of the Spanish-Speaking Californians, 1846-1890

Leonard Pitt, L. Pitt, 1966 .