The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Adam Kalai: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Avrim Blum, Adam Kalai
    Universal Portfolios With and Without Transaction Costs. [Citation Graph (0, 0)][DBLP]
    COLT, 1997, pp:309-313 [Conf]
  2. Avrim Blum, Adam Kalai, John Langford
    Beating the Hold-Out: Bounds for K-fold and Progressive Cross-Validation. [Citation Graph (0, 0)][DBLP]
    COLT, 1999, pp:203-208 [Conf]
  3. Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
    Logarithmic Regret Algorithms for Online Convex Optimization. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:499-513 [Conf]
  4. Adam Kalai
    Learning Monotonic Linear Functions. [Citation Graph (0, 0)][DBLP]
    COLT, 2004, pp:487-501 [Conf]
  5. Adam Kalai, Santosh Vempala
    Efficient Algorithms for Online Decision Problems. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:26-40 [Conf]
  6. Avrim Blum, Carl Burch, Adam Kalai
    Finely-Competitive Paging. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:450-458 [Conf]
  7. Adam Kalai, Santosh Vempala
    Efficient Algorithms for Universal Portfolios. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:486-491 [Conf]
  8. Heung-Yeung Shum, Adam Kalai, Steven M. Seitz
    Omnivergent Stereo. [Citation Graph (0, 0)][DBLP]
    ICCV, 1999, pp:22-29 [Conf]
  9. Ivona Bezáková, Adam Kalai, Rahul Santhanam
    Graph model selection using maximum likelihood. [Citation Graph (0, 0)][DBLP]
    ICML, 2006, pp:105-112 [Conf]
  10. Sham M. Kakade, Adam Kalai
    From Batch to Transductive Online Learning. [Citation Graph (0, 0)][DBLP]
    NIPS, 2005, pp:- [Conf]
  11. Avrim Blum, Shuchi Chawla, Adam Kalai
    Static optimality and dynamic search-optimality in lists and trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:1-8 [Conf]
  12. Adam Kalai
    Generating random factored numbers, easily. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:412-412 [Conf]
  13. Adam Kalai
    Efficient pattern-matching with don't cares. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:655-656 [Conf]
  14. Avrim Blum, Adam Kalai, Hal Wasserman
    Noise-tolerant learning, the parity problem, and the statistical query model. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:435-440 [Conf]
  15. Adam Kalai, Rocco A. Servedio
    Boosting in the presence of noise. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:195-205 [Conf]
  16. Avrim Blum, Adam Kalai, Jon M. Kleinberg
    Admission Control to Minimize Rejections. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:155-164 [Conf]
  17. Avrim Blum, Shuchi Chawla, Adam Kalai
    Static Optimality and Dynamic Search-Optimality in Lists and Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:3, pp:249-260 [Journal]
  18. Avrim Blum, Adam Kalai, Hal Wasserman
    Noise-Tolerant Learning, the Parity Problem, and the Statistical Query Model [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  19. Steven M. Seitz, Adam Kalai, Heung-Yeung Shum
    Omnivergent Stereo. [Citation Graph (0, 0)][DBLP]
    International Journal of Computer Vision, 2002, v:48, n:3, pp:159-172 [Journal]
  20. Avrim Blum, Adam Kalai, Hal Wasserman
    Noise-tolerant learning, the parity problem, and the statistical query model. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:4, pp:506-519 [Journal]
  21. Adam Kalai, Santosh Vempala
    Efficient Algorithms for Universal Portfolios. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2002, v:3, n:, pp:423-440 [Journal]
  22. Adam Kalai
    Generating Random Factored Numbers, Easily. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2003, v:16, n:4, pp:287-289 [Journal]
  23. Avrim Blum, Adam Kalai
    Universal Portfolios With and Without Transaction Costs. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1999, v:35, n:3, pp:193-205 [Journal]
  24. Avrim Blum, Adam Kalai
    A Note on Learning from Multiple-Instance Examples. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1998, v:30, n:1, pp:23-29 [Journal]

  25. A Query Algorithm for Agnostically Learning DNF?. [Citation Graph (, )][DBLP]


  26. On the Equilibria of Alternating Move Games. [Citation Graph (, )][DBLP]


  27. Trust-based recommendation systems: an axiomatic approach. [Citation Graph (, )][DBLP]


  28. Playing Games without Observing Payoffs. [Citation Graph (, )][DBLP]


  29. The Myth of the Folk Theorem. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002