The SCEAS System
Navigation Menu

Conferences in DBLP

Computational Learning Theory (COLT) (colt)
2006 (conf/colt/2006)

  1. Luc Devroye
    Random Multivariate Search Trees. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:1- [Conf]
  2. György Turán
    On Learning and Logic. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:2-3 [Conf]
  3. Vladimir Vovk
    Predictions as Statements and Decisions. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:4- [Conf]
  4. Shai Ben-David, Ulrike von Luxburg, Dávid Pál
    A Sober Look at Clustering Stability. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:5-19 [Conf]
  5. Jon Feldman, Rocco A. Servedio, Ryan O'Donnell
    PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:20-34 [Conf]
  6. Ran El-Yaniv, Dmitry Pechyony
    Stable Transductive Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:35-49 [Conf]
  7. Matthias Hein
    Uniform Convergence of Adaptive Graph-Based Regularization. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:50-64 [Conf]
  8. Andreas Maurer
    The Rademacher Complexity of Linear Transformation Classes. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:65-78 [Conf]
  9. Ingo Steinwart, Don R. Hush, Clint Scovel
    Function Classes That Approximate the Bayes Risk. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:79-93 [Conf]
  10. Magalie Fromont, Christine Tuleau
    Functional Classification with Margin Conditions. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:94-108 [Conf]
  11. Xing Sun, Andrew B. Nobel
    Significance and Recovery of Block Structures in Binary Matrices with Noise. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:109-122 [Conf]
  12. Miroslav Dudík, Robert E. Schapire
    Maximum Entropy Distribution Estimation with Generalized Regularization. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:123-138 [Conf]
  13. Yasemin Altun, Alexander J. Smola
    Unifying Divergence Minimization and Statistical Inference Via Convex Duality. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:139-153 [Conf]
  14. Ha Quang Minh, Partha Niyogi, Yuan Yao
    Mercer's Theorem, Feature Maps, and Smoothing. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:154-168 [Conf]
  15. Nathan Srebro, Shai Ben-David
    Learning Bounds for Support Vector Machines with Learned Kernels. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:169-183 [Conf]
  16. Laurence Bisht, Nader H. Bshouty, Hanna Mazzawi
    On Optimal Learning Algorithms for Multiplicity Automata. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:184-198 [Conf]
  17. Nader H. Bshouty, Hanna Mazzawi
    Exact Learning Composed Classes with a Small Number of Mistakes. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:199-213 [Conf]
  18. Homin K. Lee, Rocco A. Servedio, Andrew Wan
    DNF Are Teachable in the Average Case. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:214-228 [Conf]
  19. Frank Balbach, Thomas Zeugmann
    Teaching Randomized Learners. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:229-243 [Conf]
  20. Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan
    Memory-Limited U-Shaped Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:244-258 [Conf]
  21. Sanjay Jain, Efim B. Kinber
    On Learning Languages from Positive Data and a Limited Number of Short Counterexamples. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:259-273 [Conf]
  22. François Denis, Yann Esposito, Amaury Habrard
    Learning Rational Stochastic Languages. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:274-288 [Conf]
  23. Mikko Koivisto
    Parent Assignment Is Hard for the MDL, AIC, and NML Costs. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:289-303 [Conf]
  24. Jeffrey C. Jackson
    Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of Attention. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:304-318 [Conf]
  25. Philip M. Long, Rocco A. Servedio
    Discriminative Learning Can Succeed Where Generative Learning Fails. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:319-334 [Conf]
  26. Adam R. Klivans, Alexander A. Sherstov
    Improved Lower Bounds for Learning Intersections of Halfspaces. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:335-349 [Conf]
  27. Lance Fortnow, Adam R. Klivans
    Efficient Learning Algorithms Yield Circuit Lower Bounds. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:350-363 [Conf]
  28. Guillaume Lecué
    Optimal Oracle Inequality for Aggregation of Classifiers Under Low Noise Condition. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:364-378 [Conf]
  29. Florentina Bunea, Alexandre B. Tsybakov, Marten H. Wegkamp
    Aggregation and Sparsity Via l1 Penalized Least Squares. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:379-391 [Conf]
  30. Jean-Yves Audibert
    A Randomized Online Learning Algorithm for Better Variance Control. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:392-407 [Conf]
  31. Shie Mannor, Nahum Shimkin
    Online Learning with Variable Stage Duration. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:408-422 [Conf]
  32. Shai Shalev-Shwartz, Yoram Singer
    Online Learning Meets Optimization in the Dual. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:423-437 [Conf]
  33. Koby Crammer
    Online Tracking of Linear Subspaces. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:438-452 [Conf]
  34. Ofer Dekel, Philip M. Long, Yoram Singer
    Online Multitask Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:453-467 [Conf]
  35. András György, Tamás Linder, György Ottucsák
    The Shortest Path Problem Under Partial Monitoring. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:468-482 [Conf]
  36. Nicolò Cesa-Bianchi, Claudio Gentile
    Tracking the Best Hyperplane with a Simple Budget Perceptron. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:483-498 [Conf]
  37. 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]
  38. Manfred K. Warmuth, Dima Kuzmin
    Online Variance Minimization. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:514-528 [Conf]
  39. Shie Mannor, John N. Tsitsiklis
    Online Learning with Constraints. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:529-543 [Conf]
  40. Jacob Abernethy, John Langford, Manfred K. Warmuth
    Continuous Experts and the Binning Algorithm. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:544-558 [Conf]
  41. Vladimir Vovk
    Competing with Wild Prediction Rules. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:559-573 [Conf]
  42. András Antos, Csaba Szepesvári, Rémi Munos
    Learning Near-Optimal Policies with Bellman-Residual Minimization Based Fitted Policy Iteration and a Single Sample Path. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:574-588 [Conf]
  43. Cynthia Rudin
    Ranking with a P-Norm Push. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:589-604 [Conf]
  44. David Cossock, Tong Zhang
    Subset Ranking Using Regression. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:605-619 [Conf]
  45. Shai Fine, Yishay Mansour
    Active Sampling for Multiple Output Identification. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:620-634 [Conf]
  46. Ping Li, Trevor Hastie, Kenneth Ward Church
    Improving Random Projections Using Marginal Information. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:635-649 [Conf]
  47. Claire Monteleoni
    Efficient Algorithms for General Active Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:650-652 [Conf]
  48. Manfred K. Warmuth
    Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:653-654 [Conf]
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