Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithmic Learning Theory [[electronic resource] ] : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, Proceedings / / edited by Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann
| Algorithmic Learning Theory [[electronic resource] ] : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, Proceedings / / edited by Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 397 p. 30 illus.) |
| Disciplina | 006.31 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Algorithms Computers Computer logic Pattern recognition Artificial Intelligence Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs Pattern Recognition |
| ISBN | 3-642-40935-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Editors’ Introduction -- Learning and Optimizing with Preferences -- Efficient Algorithms for Combinatorial Online Prediction -- Exact Learning from Membership Queries: Some Techniques, Results and New Directions -- Online Learning Universal Algorithm for Trading in Stock Market Based on the Method of Calibration -- Combinatorial Online Prediction via Metarounding -- On Competitive Recommendations -- Online PCA with Optimal Regrets -- Inductive Inference and Grammatical Inference Partial Learning of Recursively Enumerable Languages -- Topological Separations in Inductive Inference -- PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data -- Universal Knowledge-Seeking Agents for Stochastic Environments -- Teaching and Learning from Queries Order Compression Schemes -- Learning a Bounded-Degree Tree Using Separator Queries -- Faster Hoeffding Racing: Bernstein Races via Jackknife Estimates -- Robust Risk-Averse Stochastic Multi-armed Bandits -- An Efficient Algorithm for Learning with Semi-bandit Feedback -- Differentially-Private Learning of Low Dimensional Manifolds -- Generalization and Robustness of Batched Weighted Average Algorithm with V-Geometrically Ergodic Markov Data -- Adaptive Metric Dimensionality Reduction -- Dimension-Adaptive Bounds on Compressive FLD Classification -- Bayesian Methods for Low-Rank Matrix Estimation: Short Survey and Theoretical Study -- Concentration and Confidence for Discrete Bayesian Sequence Predictors -- Algorithmic Connections between Active Learning and Stochastic Convex Optimization -- Unsupervised/Semi-Supervised Learning Unsupervised Model-Free Representation Learning -- Fast Spectral Clustering via the Nyström Method -- Nonparametric Multiple Change Point Estimation in Highly Dependent Time Series. |
| Record Nr. | UNISA-996465423903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, Proceedings / / edited by Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann
| Algorithmic Learning Theory : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, Proceedings / / edited by Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 397 p. 30 illus.) |
| Disciplina | 006.31 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Logic, Symbolic and mathematical Algorithms Computers Computer logic Pattern perception Artificial Intelligence Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs Pattern Recognition |
| ISBN | 3-642-40935-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Editors’ Introduction -- Learning and Optimizing with Preferences -- Efficient Algorithms for Combinatorial Online Prediction -- Exact Learning from Membership Queries: Some Techniques, Results and New Directions -- Online Learning Universal Algorithm for Trading in Stock Market Based on the Method of Calibration -- Combinatorial Online Prediction via Metarounding -- On Competitive Recommendations -- Online PCA with Optimal Regrets -- Inductive Inference and Grammatical Inference Partial Learning of Recursively Enumerable Languages -- Topological Separations in Inductive Inference -- PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data -- Universal Knowledge-Seeking Agents for Stochastic Environments -- Teaching and Learning from Queries Order Compression Schemes -- Learning a Bounded-Degree Tree Using Separator Queries -- Faster Hoeffding Racing: Bernstein Races via Jackknife Estimates -- Robust Risk-Averse Stochastic Multi-armed Bandits -- An Efficient Algorithm for Learning with Semi-bandit Feedback -- Differentially-Private Learning of Low Dimensional Manifolds -- Generalization and Robustness of Batched Weighted Average Algorithm with V-Geometrically Ergodic Markov Data -- Adaptive Metric Dimensionality Reduction -- Dimension-Adaptive Bounds on Compressive FLD Classification -- Bayesian Methods for Low-Rank Matrix Estimation: Short Survey and Theoretical Study -- Concentration and Confidence for Discrete Bayesian Sequence Predictors -- Algorithmic Connections between Active Learning and Stochastic Convex Optimization -- Unsupervised/Semi-Supervised Learning Unsupervised Model-Free Representation Learning -- Fast Spectral Clustering via the Nyström Method -- Nonparametric Multiple Change Point Estimation in Highly Dependent Time Series. |
| Record Nr. | UNINA-9910484834203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmic Learning Theory [[electronic resource] ] : 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings / / edited by Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann
| Algorithmic Learning Theory [[electronic resource] ] : 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings / / edited by Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIII, 421 p. 45 illus.) |
| Disciplina | 006.3/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computer programming Mathematical logic Algorithms Computers Computer logic Artificial Intelligence Programming Techniques Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs |
| ISBN |
1-280-38945-1
9786613567376 3-642-16108-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 Kernel Learning: Algorithms and Mistake Bounds -- An Identity for Kernel Ridge Regression. |
| Record Nr. | UNISA-996465982503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory [[electronic resource] ] : 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings / / edited by José L. Balcázar, Philip M. Long, Frank Stephan
| Algorithmic Learning Theory [[electronic resource] ] : 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings / / edited by José L. Balcázar, Philip M. Long, Frank Stephan |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIII, 393 p.) |
| Disciplina | 006.31 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computers Algorithms Mathematical logic Natural language processing (Computer science) Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Natural Language Processing (NLP) |
| ISBN | 3-540-46650-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Editors’ Introduction -- Editors’ Introduction -- Invited Contributions -- Solving Semi-infinite Linear Programs Using Boosting-Like Methods -- e-Science and the Semantic Web: A Symbiotic Relationship -- Spectral Norm in Learning Theory: Some Selected Topics -- Data-Driven Discovery Using Probabilistic Hidden Variable Models -- Reinforcement Learning and Apprenticeship Learning for Robotic Control -- Regular Contributions -- Learning Unions of ?(1)-Dimensional Rectangles -- On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle -- Active Learning in the Non-realizable Case -- How Many Query Superpositions Are Needed to Learn? -- Teaching Memoryless Randomized Learners Without Feedback -- The Complexity of Learning SUBSEQ (A) -- Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data -- Learning and Extending Sublanguages -- Iterative Learning from Positive Data and Negative Counterexamples -- Towards a Better Understanding of Incremental Learning -- On Exact Learning from Random Walk -- Risk-Sensitive Online Learning -- Leading Strategies in Competitive On-Line Prediction -- Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring -- General Discounting Versus Average Reward -- The Missing Consistency Theorem for Bayesian Learning: Stochastic Model Selection -- Is There an Elegant Universal Theory of Prediction? -- Learning Linearly Separable Languages -- Smooth Boosting Using an Information-Based Criterion -- Large-Margin Thresholded Ensembles for Ordinal Regression: Theory and Practice -- Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence -- Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning -- Unsupervised Slow Subspace-Learning from Stationary Processes -- Learning-Related Complexity of Linear Ranking Functions. |
| Record Nr. | UNISA-996466021703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings / / edited by Rahul Jain, Sanjay Jain, Frank Stephan
| Theory and Applications of Models of Computation [[electronic resource] ] : 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings / / edited by Rahul Jain, Sanjay Jain, Frank Stephan |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XII, 466 p. 83 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science—Mathematics Algorithms Computer science Data structures (Computer science) Information theory Formal Languages and Automata Theory Mathematics of Computing Computer Science Logic and Foundations of Programming Data Structures and Information Theory |
| ISBN | 3-319-17142-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recursion theory and mathematical logic -- Computational complexity and Boolean functions -- Graph theory -- Quantum computing -- Parallelism and statistics -- Learning, automata and probabilistic models -- Parameterised complexity. |
| Record Nr. | UNISA-996208604103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Models of Computation : 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings / / edited by Rahul Jain, Sanjay Jain, Frank Stephan
| Theory and Applications of Models of Computation : 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings / / edited by Rahul Jain, Sanjay Jain, Frank Stephan |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XII, 466 p. 83 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science—Mathematics Algorithms Computer science Data structures (Computer science) Information theory Formal Languages and Automata Theory Mathematics of Computing Computer Science Logic and Foundations of Programming Data Structures and Information Theory |
| ISBN | 3-319-17142-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recursion theory and mathematical logic -- Computational complexity and Boolean functions -- Graph theory -- Quantum computing -- Parallelism and statistics -- Learning, automata and probabilistic models -- Parameterised complexity. |
| Record Nr. | UNINA-9910484640103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||