Conferences in DBLP
Katharina Morik Tailoring Representations to Different Requirements. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:1-12 [Conf ] Robert E. Schapire Theoretical Views of Boosting and Applications. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:13-25 [Conf ] Kenji Yamanishi Extended Stochastic Complexity and Minimax Relative Loss Analysis. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:26-38 [Conf ] Sumio Watanabe Algebraic Analysis for Singular Statistical Estimation. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:39-50 [Conf ] Kenji Fukumizu Generalization Error of Limear Neural Networks in Unidentifiable Cases. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:51-62 [Conf ] Jirí Wiedermann The Computational Limits to the Cognitive Power of the Neuroidal Tabula Rasa. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:63-76 [Conf ] José L. Balcázar , Jorge Castro , David Guijarro , Hans-Ulrich Simon The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:77-92 [Conf ] Andrew R. Mitchell , Tobias Scheffer , Arun Sharma , Frank Stephan The VC-Dimension of Subclasses of Pattern. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:93-105 [Conf ] Theodoros Evgeniou , Massimiliano Pontil On the Vgamma Dimension for Regression in Reproducing Kernel Hilbert Spaces. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:106-117 [Conf ] Steffen Lange , Gunter Grieser On the Strength of Incremental Learning. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:118-131 [Conf ] Peter Rossmanith Learning from Random Text. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:132-144 [Conf ] Phil Watson Inductive Learning with Corroboration. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:145-156 [Conf ] Kouichi Hirata Flattening and Implication. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:157-168 [Conf ] Yutaka Sasaki Induction of Logic Programs Based on psi-Terms. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:169-181 [Conf ] Richard Nock Complexity in the Case against Accuracy: When Building one Function-Free Horn Clause is as Hard as Any. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:182-193 [Conf ] Nobuhiro Morita , Makoto Haraguchi , Yoshiaki Okubo A Method of Similarity-Driven Knowledge Revision for Type Specializations. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:194-205 [Conf ] Nader H. Bshouty , Nadav Eiron , Eyal Kushilevitz PAC Learning with Nasty Noise. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:206-218 [Conf ] Francesco De Comité , François Denis , Rémi Gilleron , Fabien Letouzey Positive and Unlabeled Examples Help Learning. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:219-230 [Conf ] Dennis Cheung Learning Real Polynomials with a Turing Machine. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:231-240 [Conf ] Carlos Domingo Faster Near-Optimal Reinforcement Learning: Adding Adaptiveness to the E3 Algorithm. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:241-251 [Conf ] Ryan M. Rifkin , Massimiliano Pontil , Alessandro Verri A Note on Support Vector Machine Degeneracy. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:252-263 [Conf ] Jochen Nessel Learnability of Enumerable Classes of Recursive Functions from "Typical" Examples. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:264-275 [Conf ] Frank Stephan , Thomas Zeugmann On the Uniform Learnability of Approximations to Non-Recursive Functions. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:276-290 [Conf ] Montserrat Hermo , Víctor Lavín Learning Minimal Covers of Functional Dependencies with Queries. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:291-300 [Conf ] Víctor Dalmau Boolean Formulas are Hard to Learn for most Gate Bases. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:301-312 [Conf ] David Guijarro , Jun Tarui , Tatsuie Tsukiji Finding Relevant Variables in PAC Model with Membership Queries. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:313-0 [Conf ] Yuri Kalnishkan Genral Linear Relations among Different Types of Predictive Complexity. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:323-334 [Conf ] Eiji Takimoto , Manfred K. Warmuth Predicting Nearly as well as the best Pruning of a Planar Decision Graph. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:335-346 [Conf ] Sally A. Goldman , Stephen Kwek On Learning Unions of Pattern Languages and Tree Patterns. [Citation Graph (0, 0)][DBLP ] ATL, 1999, pp:347-363 [Conf ]