Travelled to:1 × Germany
6 × USA
Collaborated with:C.Heeren M.Frazier R.A.Board M.K.Warmuth C.H.Smith H.V.Jagadish M.J.Kearns M.Li L.G.Valiant
Talks about:learn (2) algorithm (1) proposit (1) polynomi (1) learnabl (1) approxim (1) sentenc (1) problem (1) probabl (1) minimum (1)
Person: Leonard Pitt
DBLP: Pitt:Leonard
Contributed to:
2005
2003
1993
19901989
19871987Wrote 7 papers:
- KDD-2005-HeerenP
- Maximal boasting (CH, LP), pp. 580–585.
- PODS-2003-HeerenJP #using
- Optimal indexing using near-minimal space (CH, HVJ, LP), pp. 244–251.
- ICML-1993-FrazierP #learning
- Learning From Entailment: An Application to Propositional Horn Sentences (MF, LP), pp. 120–127.
- STOC-1990-BoardP #algorithm #on the
- On the Necessity of Occam Algorithms (RAB, LP), pp. 54–63.
- STOC-1989-PittW #approximate #automaton #consistency #polynomial #problem
- The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial (LP, MKW), pp. 421–432.
- ICALP-1987-PittS #learning #probability
- Probability and Plurality for Aggregations of Learning Machines (LP, CHS), pp. 1–10.
- STOC-1987-KearnsLPV #on the
- On the Learnability of Boolean Formulae (MJK, ML, LP, LGV), pp. 285–295.