Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar9. COLT 1996: Desenzano del Garda, Italy
Avrim Blum, Michael J. Kearns:
Proceedings of the Ninth Annual Conference on Computational Learning Theory, COLT 1996, Desenzano del Garda, Italy, June 28-July 1, 1996. ACM 1996, ISBN 0-89791-811-8- Leslie Ann Goldberg:
Analysis of a Simple Learning Algorithm: Learning Foraging Thresholds for Lizards. 2-9 - William W. Cohen:
The Dual DFA Learning Problem: Hardness Results for Programming by Demonstration and Learning First-Order Representations (Extended Abstract). 29-40 - Sean B. Holden:
PAC-Like Upper Bounds for the Sample Complexity of Leave-one-Out Cross-Validation. 41-50 - Joel Ratsaby, Ron Meir, Vitaly Maiorov:
Towards Robust Model Selection Using Estimation and Approximation Error Bounds. 57-67 - John Shawe-Taylor, Peter L. Bartlett, Robert C. Williamson, Martin Anthony:
A Framework for Structural Risk Minimisation. 68-76 - Kenji Yamanishi:
A Randomized Approximation of the MDL for Stochastic Models with Hidden Variables. 99-109 - V. G. Vovk:
Learning an Optimal Decision Strategy in an Influence Diagram with Latent Variables. 110-121 - Peter L. Bartlett, Shai Ben-David, Sanjeev R. Kulkarni:
Learning Changing Concepts by Exploiting the Structure of Change. 131-139 - Wee Sun Lee, Peter L. Bartlett, Robert C. Williamson:
The Importance of Convexity in Learning with Squared Loss. 140-146 - Lawrence K. Saul, Satinder P. Singh:
Learning Curve Bounds for a Markov Decision Process with Undiscounted Rewards. 147-156 - Ganesh Baliga, John Case, Sanjay Jain:
Synthesizing Enumeration Techniques for Language Learning. 169-180 - Sanjay Jain, Arun Sharma:
Elementary Formal Systems, Intrinsic Complexity, and Procrastination. 181-192 - Dick De Jongh, Makoto Kanazawa:
Angluin's Theorem for Indexed Families of r.e. Sets and Applications. 193-204 - Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jackson, Norbert Klasner, Hans Ulrich Simon:
On Restricted-Focus-of-Attention Learnability of Boolean Functions. 205-216 - Igal Galperin:
Analysis of Greedy Expert Hiring and an Application to Memory-Based Learning (Extended Abstract). 217-223 - Nader H. Bshouty, Christino Tamon, David K. Wilson:
On Learning width Two Branching Programs (Extended Abstract). 224-227 - Philip M. Long, Lei Tan:
PAC Learning Axis-Aligned Rectangles with Respect to Product Distributions from Multiple-Instance Examples. 228-234 - Nader H. Bshouty, Lisa Hellerstein:
Attribute-Efficient Learning in Query and Mistake-Bound Models. 235-243 - Stephen Kwek, Leonard Pitt:
PAC Learning Intersections of Halfspaces with Membership Queries (Extended Abstract). 244-254 - Aaron Feigelson, Lisa Hellerstein:
Learning Conjunctions of Two Unate DNF Formulas (Extended Abstract): Computational and Informational Results. 255-265 - Nicolò Cesa-Bianchi, David P. Helmbold, Sandra Panizza:
On Bayes Methods for On-Line Boolean Prediction. 314-324 - Peter Auer, Stephen Kwek, Wolfgang Maass, Manfred K. Warmuth:
Learning of Depth Two Neural Networks with Constant Fan-In at the Hidden Nodes (Extended Abstract). 333-343
maintained by 
, founded at 
, founded at 
last updated on 2019-02-20 22:20 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
