Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Pitt, L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
PAC learning intersections of halfspaces with membership queries
S. Kwek
,
L. Pitt
Algorithmica
22
(1-2), 1998, pp. 53-75
The minimum consistent DFA problem cannot be approximated within any polynomial
L. Pitt
,
M.K. Warmuth
Journal of the ACM
40
(1), 1993, January, pp. 95-142
Learning conjunctions of Horn clauses
D. Angluin
,
M. Frazier
,
L. Pitt
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 186-192
On the necessity of Occam algorithms
R. Board
,
L. Pitt
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 54-63
The minimum consistent DFA problem cannot be approximated within any polynomial
L. Pitt
,
M. Warmuth
Proceedings of the 4th Annual Conference on Structure in Complexity Theory, CSCT'89 (University of Oregon, Eugene, Oregon, June 19-22, 1989)
, 1989, pp. 230
Probabilistic inductive inference
L. Pitt
Journal of the ACM
36
(2), 1989, April, pp. 383-433
Reductions among prediction problems
L. Pitt
,
M.K. Warmuth
Proceedings of the 3rd Annual Conference on Structure in Complexity Theory, CSCT'88 (Georgetown University, Washington D.C., June 14-17 1988)
, 1988, pp. 60-69
On the learnability of boolean formulae
M. Kearns
,
M. Li
,
L. Pitt
,
L. Valiant
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 285-295
Probability and plurality for aggregations of learning machines
L. Pitt
,
C.H. Smith
Lecture Notes in Computer Science
267
, 1987, pp. 1-10
A note on extending Knuth's tree estimator to directed acyclic graphs
L. Pitt
Information Processing Letters
24
(3), 1987, February, pp. 203-206
Equivalent approximation algorithms for node cover
D. Gusfield
,
L. Pitt
Information Processing Letters
22
(6), 1986, May, pp. 291-294
A characterization of probabilistic inference
L. Pitt
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 485-494