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
[4]
Hilfe
Suche: Author="Schapire, Robert E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Learning with continuous experts using drifting games
Indraneel Mukherjee
,
Robert E. Schapire
Theoretical Computer Science
411
(29-30), 2010, pp. 2670-2683
Aneuploidy prediction and tumor classification with heterogeneous hidden conditional random fields
Zafer Barutcuoglu
,
Edoardo M. Airoldi
,
Vanessa Dumeaux
,
Robert E. Schapire
,
Olga G. Troyanskaya
Bioinformatics
25
(10), 2009, pp. 1307-1313
Hierarchical multi-label prediction of gene function
Zafer Barutcuoglu
,
Robert E. Schapire
,
Olga G. Troyanskaya
Bioinformatics
22
(7), 2006, pp. 830-836
The nonstochastic multiarmed bandit problem
Peter Auer
,
Nicolò Cesa-Bianchi
,
Yoav Freund
,
Robert E. Schapire
SIAM Journal on Computing
32
(1), 2002-2003, pp. 48-77
Logistic regression, AdaBoost and Bregman distances
Michael Collins
,
Robert E. Schapire
,
Yoram Singer
Technical Report (2001-17), 2001
An efficient boosting algorithm for combining preferences
Yoav Freund
,
Raj Iyer
,
Robert E. Schapire
,
Yoram Singer
Technical Report (2001-22), 2001
Reducing multiclass to binary: A unifying approach for margin classifiers
Erin L. Allwein
,
Robert E. Schapire
,
Yoram Singer
Technical Report (2000-49), 2000
How to use expert advice
Nicolò Cesa-Bianchi
,
Yoav Freund
,
David Haussler
,
David P. Helmbold
,
Robert E. Schapire
,
Manfred K. Warmuth
Journal of the ACM
44
(3), 1997, pp. 427-485
Efficient learning of typical finite automata from random walks
Yoav Freund
,
Michael Kearns
,
Dana Ron
,
Ronitt Rubinfeld
,
Robert E. Schapire
Information and Computation
138
(1), 1997, pp. 23-48
Using and combining predictors that specialize
Yoav Freund
,
Robert E. Schapire
,
Yoram Singer
,
Manfred K. Warmuth
Proceedings of the 29th Annual ACM Symposium on Theory of Computing, STOC'97 (El Paso, Texas, May 4-6, 1997)
, 1997, pp. 334-343
A decision-theoretic generalization of on-line learning and an application to boosting
Yoav Freund
,
Robert E. Schapire
Journal of Computer and System Sciences
55
(1), 1997, pp. 119-139
Learning sparse multivariate polynomials over a field with queries and counterexamples
Robert E. Schapire
,
Linda M. Sellie
Journal of Computer and System Sciences
52
(2), 1996, pp. 201-213
Gambling in a rigged casino: The adversarial multi-armed bandit problem
Peter Auer
,
Nicolò Cesa-Bianchi
,
Yoav Freund
,
Robert E. Schapire
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)
, 1995, pp. 322-331
Efficient algorithms for learning to play repeated games against computationally bounded adversaries
Yoav Freund
,
Michael Kearns
,
Yishay Mansour
,
Dana Ron
,
Ronitt Rubinfeld
,
Robert E. Schapire
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)
, 1995, pp. 332-341
On the sample complexity of weak learning
Sally A. Goldman
,
Michael J. Kearns
,
Robert E. Schapire
Information and Computation
117
(2), 1995, March, pp. 276-287
On the learnability of discrete distributions
Michael Kearns
,
Yishay Mansour
,
Dana Ron
,
Ronitt Rubinfeld
,
Robert E. Schapire
,
Linda Sellie
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montréal, Québec, Canada, May 23-25, 1994)
, 1994, pp. 273-282
Efficient distribution-free learning of probabilistic concepts
Michael J. Kearns
,
Robert E. Schapire
Journal of Computer and System Sciences
48
(3), 1994, pp. 464-497
Diversity-based inference of finite automata
Ronald L. Rivest
,
Robert E. Schapire
Journal of the ACM
41
(3), 1994, May, pp. 555-589
How to use expert advice (extended abstract)
Nicolò Cesa-Bianchi
,
Yoav Freund
,
David P. Helmbold
,
David Haussler
,
Robert E. Schapire
,
Manfred K. Warmuth
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 382-391
Efficient learning of typical finite automata from random walks (extended abstract)
Yoav Freund
,
Michael Kearns
,
Dana Ron
,
Ronitt Rubinfeld
,
Robert E. Schapire
,
Linda Sellie
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 315-324
Exact identification of read-once formulas using fixed points of amplification functions
Sally A. Goldman
,
Michael J. Kearns
,
Robert E. Schapire
SIAM Journal on Computing
22
(4), 1993, August, pp. 705-726
Learning binary relations and total orders
Sally A. Goldman
,
Ronald L. Rivest
,
Robert E. Schapire
SIAM Journal on Computing
22
(5), 1993, October, pp. 1006-1034
Inference of finite automata using homing sequences
Ronald L. Rivest
,
Robert E. Schapire
Information and Computation
103
(2), 1993, April, pp. 299-347
Inference of finite automata using homing sequences
Ronald L. Rivest
,
Robert E. Schapire
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, STOC'89 (Seattle, Washington, May 15-17, 1989)
, 1989, pp. 411-420