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
[2]
Hilfe
Suche: Author="Kalai, Adam"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reliable agnostic learning
Adam Tauman Kalai
,
Varun Kanade
,
Yishay Mansour
Journal of Computer and System Sciences
78
(5), 2012, pp. 1481-1495
Dueling algorithms
Nicole Immorlica
,
Adam Tauman Kalai
,
Brendan Lucier
,
Ankur Moitra
,
Andrew Postlewaite
,
Moshe Tennenholtz
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 215-224
Efficiently learning mixtures of two Gaussians
Adam Tauman Kalai
,
Ankur Moitra
,
Gregory Valiant
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 553-562
Playing games with approximation algorithms
Sham M. Kakade
,
Adam Tauman Kalai
,
Katrina Ligett
SIAM Journal on Computing
39
(3), 2009, pp. 1088-1106
The myth of the folk theorem
Christian Borgs
,
Jennifer Chayes
,
Nicole Immorlica
,
Adam Tauman Kalai
,
Vahab Mirrokni
,
Christos Papadimitriou
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 365-372
Agnostically learning decision trees
Parikshit Gopalan
,
Adam Tauman Kalai
,
Adam R. Klivans
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 527-536
Agnostically learning halfspaces
Adam Tauman Kalai
,
Adam R. Klivans
,
Yishay Mansour
,
Rocco A. Servedio
SIAM Journal on Computing
37
(6), 2008, pp. 1777-1805
On agnostic boosting and parity learning
Adam Tauman Kalai
,
Yishay Mansour
,
Elad Verbin
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 629-638
Playing games with approximation algorithms
Sham M. Kakade
,
Adam Tauman Kalai
,
Katrina Ligett
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 546-555
Boosting in the presence of noise
Adam Tauman Kalai
,
Rocco A. Servedio
Journal of Computer and System Sciences
71
(3), 2005, pp. 266-290
Efficient algorithms for online decision problems
Adam Kalai
,
Santosh Vempala
Journal of Computer and System Sciences
71
(3), 2005, pp. 291-307
Static optimality and dynamic search-optimality in lists and trees
Avrim Blum
,
Shuchi Chawla
,
Adam Kalai
Algorithmica
36
(3), 2003, pp. 249-260
Noise-tolerant learning, the parity problem, and the statistical query model
Avrim Blum
,
Adam Kalai
,
Hal Wasserman
Journal of the ACM
50
(4), 2003, pp. 506-519
Boosting in the presence of noise
Adam Kalai
,
Rocco A. Servedio
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 196-205
Admission control to minimize rejections
Avrim Blum
,
Adam Kalai
,
Jon Kleinberg
Lecture Notes in Computer Science
2125
, 2001, pp. 155-164
Noise-tolerant learning, the parity problem, and the statistical query model
Avrim Blum
,
Adam Kalai
,
Hal Wasserman
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 435-440