Algorithmic Learning Theory: 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings: Lecture Notes in Computer Science, cartea 6331
Editat de Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmannen Limba Engleză Paperback – 27 sep 2010
Din seria Lecture Notes in Computer Science
- 20%
Preț: 558.53 lei - 20%
Preț: 571.88 lei - 20%
Preț: 675.83 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 620.33 lei - 20%
Preț: 560.93 lei - 20%
Preț: 633.70 lei - 20%
Preț: 678.21 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 748.63 lei - 20%
Preț: 562.49 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 449.81 lei - 20%
Preț: 556.96 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 313.10 lei - 18%
Preț: 945.44 lei - 20%
Preț: 314.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 313.87 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 15%
Preț: 672.87 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 979.25 lei - 20%
Preț: 402.28 lei - 20%
Preț: 316.28 lei - 20%
Preț: 636.06 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei
Preț: 327.54 lei
Preț vechi: 409.42 lei
-20%
Puncte Express: 491
Preț estimativ în valută:
57.88€ • 67.08$ • 50.47£
57.88€ • 67.08$ • 50.47£
Carte disponibilă
Livrare economică 24 aprilie-08 mai
Specificații
ISBN-13: 9783642161070
ISBN-10: 3642161073
Pagini: 434
Ilustrații: XIII, 421 p. 45 illus.
Greutate: 0.64 kg
Ediția:2010
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: 3642161073
Pagini: 434
Ilustrații: XIII, 421 p. 45 illus.
Greutate: 0.64 kg
Ediția:2010
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
Editors’ Introduction.- Editors’ Introduction.- Invited Papers.- Towards General Algorithms for Grammatical Inference.- The Blessing and the Curse of the Multiplicative Updates.- Discovery of Abstract Concepts by a Robot.- Contrast Pattern Mining and Its Application for Building Robust Classifiers.- Optimal Online Prediction in Adversarial Environments.- Regular Contributions.- An Algorithm for Iterative Selection of Blocks of Features.- Bayesian Active Learning Using Arbitrary Binary Valued Queries.- Approximation Stability and Boosting.- A Spectral Approach for Probabilistic Grammatical Inference on Trees.- PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation.- Inferring Social Networks from Outbreaks.- Distribution-Dependent PAC-Bayes Priors.- PAC Learnability of a Concept Class under Non-atomic Measures: A Problem by Vidyasagar.- A PAC-Bayes Bound for Tailored Density Estimation.- Compressed Learning with Regular Concept.- A Lower Bound for Learning Distributions Generated by Probabilistic Automata.- Lower Bounds on Learning Random Structures with Statistical Queries.- Recursive Teaching Dimension, Learning Complexity, and Maximum Classes.- Toward a Classification of Finite Partial-Monitoring Games.- Switching Investments.- Prediction with Expert Advice under Discounted Loss.- A Regularization Approach to Metrical Task Systems.- Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations.- Learning without Coding.- Learning Figures with the Hausdorff Metric by Fractals.- Inductive Inference of Languages from Samplings.- Optimality Issues of Universal Greedy Agents with Static Priors.- Consistency of Feature Markov Processes.- Algorithms for Adversarial Bandit Problems with Multiple Plays.- Online Multiple KernelLearning: Algorithms and Mistake Bounds.- An Identity for Kernel Ridge Regression.
Caracteristici
unique visibility, state-of-the-art survey, fast-track conference proceedings