Conferences in DBLP
Thomas M. Cover Learning and Generalization.(Abstract). [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:3- [Conf ] Rodney A. Brooks The Role of Learning in Autonomous Robots. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:5-10 [Conf ] David P. Helmbold , Philip M. Long Tracking Drifting Concepts Using Random Examples. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:13-23 [Conf ] Peter L. Bartlett , Robert C. Williamson Investigating the Distribution Assumptions in the Pac Learning Model. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:24-32 [Conf ] Kevin Buescher , P. R. Kumar Simultaneous Learning of Concepts and Simultaneous Estimation of Probabilities. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:33-42 [Conf ] Woonkyung Michael Kim Learning by Smoothing: A Morphological Approach. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:43-57 [Conf ] David Haussler , Michael J. Kearns , Robert E. Schapire Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:61-74 [Conf ] Manfred Opper , David Haussler Calculation of the Learning Curve of Bayes Optimal Classification Algorithm for Learning a Perceptron With Noise. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:75-87 [Conf ] Paul Fisher , Stefan Pölt , Hans-Ulrich Simon Probably Almost Bayes Decisions. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:88-94 [Conf ] Vwani P. Roychowdhury , Kai-Yeung Siu , Alon Orlitsky , Thomas Kailath A Geometric Approach to Threshold Circuit Complexity. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:97-111 [Conf ] H. Sebastian Seung , Haim Sompolinsky , Naftali Tishby Learning Curves in Large Neural Networks. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:112-127 [Conf ] Oded Maler , Amir Pnueli On the Learnability of Infinitary Regular Sets. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:128-136 [Conf ] Dana Angluin , Donna K. Slonim Learning Monotone DNF with an Incomplete Membership Oracle. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:139-146 [Conf ] Nick Littlestone Redundant Noisy Attributes, Attribute Errors, and Linear-Threshold Learning Using Winnow. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:147-156 [Conf ] Avrim Blum , Lisa Hellerstein , Nick Littlestone Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:157-166 [Conf ] Wolfgang Maass On-Line Learning with an Oblivious Environment and the Power of Randomization. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:167-175 [Conf ] Thomas R. Hancock , Yishay Mansour Learning Monotone kµ DNF Formulas on Product Distributions. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:179-183 [Conf ] Robert E. Schapire Learning Probabilistic Read-Once Formulas on Product Distributions. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:184-198 [Conf ] Thomas R. Hancock Learning 2µ DNF Formulas and kµ Decision Trees. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:199-209 [Conf ] Takashi Yokomori Polynomial-Time Learning of Very Simple Grammars from Positive Data. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:213-227 [Conf ] Robert P. Daley , Leonard Pitt , Mahendran Velauthapillai , Todd Will Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:228-239 [Conf ] Andrew R. Barron Approximation and Estimation Bounds for Artificial Neural Networks. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:243-249 [Conf ] Chuanyi Ji , Demetri Psaltis The VC-Dimension vs. the Statistical Capacity for Two Layer Networks with Binary Weights. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:250-256 [Conf ] Santosh S. Venkatesh On Learning Binary Weights for Majority Functions. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:257-266 [Conf ] Andrew B. Nobel Evaluating the Performance of a Simple Inductive Procedure in the Presence of Overfitting Error. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:267-274 [Conf ] Naoki Abe , Manfred K. Warmuth , Jun-ichi Takeuchi Polynomial Learnability of Probabilistic Concepts with Respect to the Kullback-Leibler Divergence. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:277-289 [Conf ] Kenji Yamanishi A Loss Bound Model for On-Line Stochastic Prediction Strategies. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:290-302 [Conf ] Sally A. Goldman , Michael J. Kearns On the Complexity of Teaching. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:303-314 [Conf ] Merrick L. Furst , Jeffrey C. Jackson , Sean W. Smith Improved Learning of AC^{0} Functions. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:317-325 [Conf ] Thomas R. Hancock , Lisa Hellerstein Learning Read-Once Formulas over Fields and Extended Bases. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:326-336 [Conf ] William J. Bultman , Wolfgang Maass Fast Identification of Geometric Objects with Membership Queries. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:337-353 [Conf ] Vijay Raghavan Bounded Degree Graph Inference from Walks. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:354-366 [Conf ] Tao Jiang , Ming Li On the Complexity of Learning Strings and Sequences. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:367-371 [Conf ] Tatsuya Motoki , Takeshi Shinohara , Keith Wright The Correct Definition of Finite Elasticity: Corrigendum to Identification of Unions. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:375- [Conf ] Theodore A. Slaman , Robert Solovay When Oracles Do Not Help. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:379-383 [Conf ]