Algorithmic Learning Theory: 10th International Conference, ALT '99 Tokyo, Japan, December 6-8, 1999 Proceedings: Lecture Notes in Computer Science, cartea 1720
Editat de Osamu Watanabe, Takashi Yokomorien Limba Engleză Paperback – 17 noi 1999
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 449.57 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 18% Preț: 938.83 lei
- 20% Preț: 591.51 lei
- 15% Preț: 438.59 lei
- 20% Preț: 337.00 lei
- Preț: 389.48 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- 20% Preț: 649.49 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 336.67 lei
Preț vechi: 420.84 lei
-20% Nou
Puncte Express: 505
Preț estimativ în valută:
64.42€ • 67.44$ • 53.30£
64.42€ • 67.44$ • 53.30£
Carte tipărită la comandă
Livrare economică 05-19 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540667483
ISBN-10: 3540667482
Pagini: 384
Ilustrații: XII, 372 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540667482
Pagini: 384
Ilustrații: XII, 372 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Lectures.- Tailoring Representations to Different Requirements.- Theoretical Views of Boosting and Applications.- Extended Stochastic Complexity and Minimax Relative Loss Analysis.- Regular Contributions.- Algebraic Analysis for Singular Statistical Estimation.- Generalization Error of Linear Neural Networks in Unidentifiable Cases.- The Computational Limits to the Cognitive Power of the Neuroidal Tabula Rasa.- The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract).- The VC-Dimension of Subclasses of Pattern Languages.- On the V ? Dimension for Regression in Reproducing Kernel Hilbert Spaces.- On the Strength of Incremental Learning.- Learning from Random Text.- Inductive Learning with Corroboration.- Flattening and Implication.- Induction of Logic Programs Based on ?-Terms.- Complexity in the Case Against Accuracy: When Building One Function-Free Horn Clause Is as Hard as Any.- A Method of Similarity-Driven Knowledge Revision for Type Specializations.- PAC Learning with Nasty Noise.- Positive and Unlabeled Examples Help Learning.- Learning Real Polynomials with a Turing Machine.- Faster Near-Optimal Reinforcement Learning: Adding Adaptiveness to the E3 Algorithm.- A Note on Support Vector Machine Degeneracy.- Learnability of Enumerable Classes of Recursive Functions from “Typical” Examples.- On the Uniform Learnability of Approximations to Non-recursive Functions.- Learning Minimal Covers of Functional Dependencies with Queries.- Boolean Formulas Are Hard to Learn for Most Gate Bases.- Finding Relevant Variables in PAC Model with Membership Queries.- General Linear Relations among Different Types of Predictive Complexity.- Predicting Nearly as Well as the Best Pruning of a Planar Decision Graph.- On Learning Unionsof Pattern Languages and Tree Patterns.
Caracteristici
Includes supplementary material: sn.pub/extras