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-8David D. Lewis:
Challenges in Machine Learning for Text Classification. 1Leslie Ann Goldberg:
Analysis of a Simple Learning Algorithm: Learning Foraging Thresholds for Lizards. 2-9Anthony M. Zador, Barak A. Pearlmutter:
VC Dimension of an Integrate-and-Fire Neuron Model. 10-18Sven Koenig, Yury V. Smirnov:
Graph Learning with a Nearest Neighbor Approach. 19-28William W. Cohen:
The Dual DFA Learning Problem: Hardness Results for Programming by Demonstration and Learning First-Order Representations (Extended Abstract). 29-40Sean B. Holden:
PAC-Like Upper Bounds for the Sample Complexity of Leave-one-Out Cross-Validation. 41-50Gábor Lugosi, Márta Pintér:
A Data-Dependent Skeleton Estimate for Learning. 51-56Joel Ratsaby, Ron Meir, Vitaly Maiorov:
Towards Robust Model Selection Using Estimation and Approximation Error Bounds. 57-67John Shawe-Taylor, Peter L. Bartlett, Robert C. Williamson, Martin Anthony:
A Framework for Structural Risk Minimisation. 68-76Jonathan Baxter:
A Bayesian/Information Theoretic Model of Bias Learning. 77-88Yoav Freund:
Predicting a Binary Sequence Almost As Well As the Optimal Biased Coin. 89-98Kenji Yamanishi:
A Randomized Approximation of the MDL for Stochastic Models with Hidden Variables. 99-109V. G. Vovk:
Learning an Optimal Decision Strategy in an Influence Diagram with Latent Variables. 110-121Rakesh D. Barve, Philip M. Long:
On the Complexity of Learning from Drifting Distributions. 122-130Peter L. Bartlett, Shai Ben-David, Sanjeev R. Kulkarni:
Learning Changing Concepts by Exploiting the Structure of Change. 131-139Wee Sun Lee, Peter L. Bartlett, Robert C. Williamson:
The Importance of Convexity in Learning with Squared Loss. 140-146Lawrence K. Saul, Satinder P. Singh:
Learning Curve Bounds for a Markov Decision Process with Undiscounted Rewards. 147-156Andris Ambainis:
Probabilistic and Team PFIN-Type Learning: General Properties. 157-168Ganesh Baliga, John Case, Sanjay Jain:
Synthesizing Enumeration Techniques for Language Learning. 169-180Sanjay Jain, Arun Sharma:
Elementary Formal Systems, Intrinsic Complexity, and Procrastination. 181-192Dick De Jongh, Makoto Kanazawa:
Angluin's Theorem for Indexed Families of r.e. Sets and Applications. 193-204Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jackson, Norbert Klasner, Hans Ulrich Simon:
On Restricted-Focus-of-Attention Learnability of Boolean Functions. 205-216Igal Galperin:
Analysis of Greedy Expert Hiring and an Application to Memory-Based Learning (Extended Abstract). 217-223Nader H. Bshouty, Christino Tamon, David K. Wilson:
On Learning width Two Branching Programs (Extended Abstract). 224-227Philip M. Long, Lei Tan:
PAC Learning Axis-Aligned Rectangles with Respect to Product Distributions from Multiple-Instance Examples. 228-234Nader H. Bshouty, Lisa Hellerstein:
Attribute-Efficient Learning in Query and Mistake-Bound Models. 235-243Stephen Kwek, Leonard Pitt:
PAC Learning Intersections of Halfspaces with Membership Queries (Extended Abstract). 244-254Aaron Feigelson, Lisa Hellerstein:
Learning Conjunctions of Two Unate DNF Formulas (Extended Abstract): Computational and Informational Results. 255-265Eyal Kushilevitz:
A Simple Algorithm for Learning O(log n)-Term DNF. 266-269Wolfgang Merkle, Frank Stephan:
Trees and Learning. 270-279Martin Kummer, Matthias Ott:
Learning Branches and Learning to Win Closed Games. 280-291Christopher D. Rosin, Richard K. Belew:
A Competitive Approach to Game Learning. 292-302András Antos, Gábor Lugosi:
Strong Minimax Lower Bounds for Learning. 303-309Erik Ordentlich, Thomas M. Cover:
On-Line Portfolio Selection. 310-313Nicolò Cesa-Bianchi, David P. Helmbold, Sandra Panizza:
On Bayes Methods for On-Line Boolean Prediction. 314-324Yoav Freund, Robert E. Schapire:
Game Theory, On-Line Prediction and Boosting. 325-332Peter 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
last updated on 2019-10-16 00:07 CEST 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:
