dblp.uni-trier.dewww.uni-trier.de

Leonard Pitt Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2005
48EECinda Heeren, Leonard Pitt: Maximal boasting. KDD 2005: 580-585
2004
47EEHaym Hirsh, Nina Mishra, Leonard Pitt: Version spaces and the consistency problem. Artif. Intell. 156(2): 115-138 (2004)
2003
46EEJoseph Elble, Cinda Heeren, Leonard Pitt: Optimized Disjunctive Association Rules via Sampling. ICDM 2003: 43-50
45EECinda Heeren, H. V. Jagadish, Leonard Pitt: Optimal indexing using near-minimal space. PODS 2003: 244-251
2001
44EENina Mishra, Daniel Oblinger, Leonard Pitt: Sublinear time approximate clustering. SODA 2001: 439-447
1999
43 Carlos Domingo, Nina Mishra, Leonard Pitt: Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries. Machine Learning 37(1): 89-110 (1999)
1998
42 Stephen Kwek, Leonard Pitt: PAC Learning Intersections of Halfspaces with Membership Queries. Algorithmica 22(1/2): 53-75 (1998)
41 Howard Aizenstein, Tibor Hegedüs, Lisa Hellerstein, Leonard Pitt: Complexity Theoretic Hardness Results for Query Learning. Computational Complexity 7(1): 19-53 (1998)
40EEHoward Aizenstein, Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth: On Learning Read-k-Satisfy-j DNF. SIAM J. Comput. 27(6): 1515-1530 (1998)
1997
39 Haym Hirsh, Nina Mishra, Leonard Pitt: Version Spaces without Boundary Sets. AAAI/IAAI 1997: 491-496
38 Leonard Pitt: On Exploiting Knowledge and Concept Use in Learning Theory. ALT 1997: 62-84
37EENina Mishra, Leonard Pitt: Generating all Maximal Independent Sets of Bounded-Degree Hypergraphs. COLT 1997: 211-217
36 David P. Helmbold, Stephen Kwek, Leonard Pitt: Learning When to Trust Which Experts. EuroCOLT 1997: 134-149
1996
35EEStephen Kwek, Leonard Pitt: PAC Learning Intersections of Halfspaces with Membership Queries (Extended Abstract). COLT 1996: 244-254
34 Michael Frazier, Sally A. Goldman, Nina Mishra, Leonard Pitt: Learning from a Consistently Ignorant Teacher. J. Comput. Syst. Sci. 52(3): 471-492 (1996)
33 Michael Frazier, Leonard Pitt: Classic Learning. Machine Learning 25(2-3): 151-193 (1996)
1995
32 Howard Aizenstein, Leonard Pitt: On The Learnability Of Disjunctive Normal Form Formulas. Machine Learning 19(3): 183-208 (1995)
1994
31EEAvrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth: On Learning Read-k-Satisfy-j DNF. COLT 1994: 110-117
30EEMichael Frazier, Leonard Pitt: CLASSIC Learning. COLT 1994: 23-34
29EEMichael Frazier, Sally A. Goldman, Nina Mishra, Leonard Pitt: Learning from a Consistently Ignorant Teacher. COLT 1994: 328-339
1993
28 Michael Frazier, Leonard Pitt: Learning From Entailment: An Application to Propositional Horn Sentences. ICML 1993: 120-127
27EELeonard Pitt, Manfred K. Warmuth: The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial. J. ACM 40(1): 95-142 (1993)
1992
26EEHoward Aizenstein, Leonard Pitt: Exact Learning of Read-k Disjoint DNF and Not-So-Disjoint DNF. COLT 1992: 71-76
25 Howard Aizenstein, Lisa Hellerstein, Leonard Pitt: Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries FOCS 1992: 523-532
24 Dan Gusfield, Leonard Pitt: A Bounded Approximation for the Minimum Cost 2-Sat Problem. Algorithmica 8(2): 103-117 (1992)
23 Dana Angluin, Michael Frazier, Leonard Pitt: Learning Conjunctions of Horn Clauses. Machine Learning 9: 147-164 (1992)
22 Raymond A. Board, Leonard Pitt: On the Necessity of Occam Algorithms. Theor. Comput. Sci. 100(1): 157-184 (1992)
1991
21EERobert P. Daley, Leonard Pitt, Mahendran Velauthapillai, Todd Will: Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract). COLT 1991: 228-239
20 Howard Aizenstein, Leonard Pitt: Exact Learning of Read-Twice DNF Formulas (Extended Abstract) FOCS 1991: 170-179
1990
19EEDana Angluin, Michael Frazier, Leonard Pitt: Learning Conjunctions of Horn Clauses (Abstract). COLT 1990: 387
18 Dana Angluin, Michael Frazier, Leonard Pitt: Learning Conjunctions of Horn Clauses (Extended Abstract) FOCS 1990: 186-192
17 Raymond A. Board, Leonard Pitt: On the Necessity of Occam Algorithms STOC 1990: 54-63
16 Leonard Pitt, Manfred K. Warmuth: Prediction-Preserving Reducibility. J. Comput. Syst. Sci. 41(3): 430-467 (1990)
15 Leonard Pitt: Introduction: Special Issue on Computational Learning Theory. Machine Learning 5: 117-120 (1990)
1989
14 Leonard Pitt: Inductive Inference, DFAs, and Computational Complexity. AII 1989: 18-44
13EEMichael J. Kearns, Leonard Pitt: A Polynomial-Time Algorithm for Learning k-Variable Pattern Languages from Examples. COLT 1989: 57-71
12 Leonard Pitt, Manfred K. Warmuth: The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial STOC 1989: 421-432
11 Leonard Pitt, Manfred K. Warmuth: The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial (abstract). Structure in Complexity Theory Conference 1989: 230
10EELeonard Pitt: Probabilistic inductive inference. J. ACM 36(2): 383-433 (1989)
9 Raymond A. Board, Leonard Pitt: Semi-Supervised Learning. Machine Learning 4: 41-65 (1989)
1988
8 Leonard Pitt, Carl H. Smith: Probability and Plurality for Aggregations of Learning Machines Inf. Comput. 77(1): 77-92 (1988)
7EELeonard Pitt, Leslie G. Valiant: Computational limitations on learning from examples. J. ACM 35(4): 965-984 (1988)
1987
6EELeonard Pitt, Carl H. Smith: Probability and Plurality for Aggregations of Learning Machines. ICALP 1987: 1-10
5 Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant: On the Learnability of Boolean Formulae STOC 1987: 285-295
4 Leonard Pitt: A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graphs. Inf. Process. Lett. 24(3): 203-206 (1987)
3 Leonard Pitt, Robert E. Reinke: Criteria for Polynomial-Time (Conceptual) Clustering. Machine Learning 2(4): 371-396 (1987)
1986
2 Dan Gusfield, Leonard Pitt: Equivalent Approximation Algorithms for Node Cover. Inf. Process. Lett. 22(6): 291-294 (1986)
1984
1 Leonard Pitt: A Characterization of Probabilistic Inference FOCS 1984: 485-494

Coauthor Index

1Howard Aizenstein [20] [25] [26] [32] [40] [41]
2Dana Angluin [18] [19] [23]
3Avrim Blum [31] [40]
4Raymond A. Board [9] [17] [22]
5Robert P. Daley [21]
6Carlos Domingo [43]
7Joseph Elble [46]
8Michael Frazier [18] [19] [23] [28] [29] [30] [33] [34]
9Sally A. Goldman [29] [34]
10Dan Gusfield [2] [24]
11Cinda Heeren [45] [46] [48]
12Tibor Hegedüs [41]
13Lisa Hellerstein [25] [41]
14David P. Helmbold [36]
15Haym Hirsh [39] [47]
16H. V. Jagadish [45]
17Michael J. Kearns [5] [13]
18Roni Khardon [31] [40]
19Eyal Kushilevitz [31] [40]
20Stephen Kwek [35] [36] [42]
21Ming Li [5]
22Nina Mishra [29] [34] [37] [39] [43] [44] [47]
23Daniel Oblinger [44]
24Robert E. Reinke [3]
25Dan Roth [31] [40]
26Carl H. Smith [6] [8]
27Leslie G. Valiant [5] [7]
28Mahendran Velauthapillai [21]
29Manfred K. Warmuth [11] [12] [16] [27]
30Todd Will [21]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)