Algorithmic Learning Theory [[electronic resource] ] : 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings / / edited by Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (XII, 491 p.) |
Disciplina | 006.3 |
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-31696-5
3-540-29242-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Editors’ Introduction -- Editors’ Introduction -- Invited Papers -- Invention and Artificial Intelligence -- The Arrowsmith Project: 2005 Status Report -- The Robot Scientist Project -- Algorithms and Software for Collaborative Discovery from Autonomous, Semantically Heterogeneous, Distributed Information Sources -- Training Support Vector Machines via SMO-Type Decomposition Methods -- Kernel-Based Learning -- Measuring Statistical Dependence with Hilbert-Schmidt Norms -- An Analysis of the Anti-learning Phenomenon for the Class Symmetric Polyhedron -- Learning Causal Structures Based on Markov Equivalence Class -- Stochastic Complexity for Mixture of Exponential Families in Variational Bayes -- ACME: An Associative Classifier Based on Maximum Entropy Principle -- Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors -- On Computability of Pattern Recognition Problems -- PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance -- Learnability of Probabilistic Automata via Oracles -- Learning Attribute-Efficiently with Corrupt Oracles -- Learning DNF by Statistical and Proper Distance Queries Under the Uniform Distribution -- Learning of Elementary Formal Systems with Two Clauses Using Queries -- Gold-Style and Query Learning Under Various Constraints on the Target Class -- Non U-Shaped Vacillatory and Team Learning -- Learning Multiple Languages in Groups -- Inferring Unions of the Pattern Languages by the Most Fitting Covers -- Identification in the Limit of Substitutable Context-Free Languages -- Algorithms for Learning Regular Expressions -- A Class of Prolog Programs with Non-linear Outputs Inferable from Positive Data -- Absolute Versus Probabilistic Classification in a Logical Setting -- Online Allocation with Risk Information -- Defensive Universal Learning with Experts -- On Following the Perturbed Leader in the Bandit Setting -- Mixture of Vector Experts -- On-line Learning with Delayed Label Feedback -- Monotone Conditional Complexity Bounds on Future Prediction Errors -- Non-asymptotic Calibration and Resolution -- Defensive Prediction with Expert Advice -- Defensive Forecasting for Linear Protocols -- Teaching Learners with Restricted Mind Changes. |
Record Nr. | UNISA-996466223003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic Learning Theory [[electronic resource] ] : 4th International Workshop, ALT '93, Tokyo, Japan, November 8-10, 1993. Proceedings / / edited by Klaus P. Jantke, Shigenobu Kobayashi, Etsuji Tomita, Takashi Yokomori |
Edizione | [1st ed. 1993.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
Descrizione fisica | 1 online resource (XI, 428 p.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematics Computers Artificial Intelligence Mathematics, general Theory of Computation Computation by Abstract Devices |
ISBN | 3-540-48096-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Identifying and using patterns in sequential data -- Learning theory toward Genome Informatics -- Optimal layered learning: A PAC approach to incremental sampling -- Reformulation of explanation by linear logic toward logic for explanation -- Towards efficient inductive synthesis of expressions from input/output examples -- A typed ?-calculus for proving-by-example and bottom-up generalization procedure -- Case-based representation and learning of pattern languages -- Inductive resolution -- Generalized unification as background knowledge in learning logic programs -- Inductive inference machines that can refute hypothesis spaces -- On the duality between mechanistic learners and what it is they learn -- On aggregating teams of learning machines -- Learning with growing quality -- Use of reduction arguments in determining Popperian FIN-type learning capabilities -- Properties of language classes with finite elasticity -- Uniform characterizations of various kinds of language learning -- How to invent characterizable inference methods for regular languages -- Neural Discriminant Analysis -- A new algorithm for automatic configuration of Hidden Markov Models -- On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions -- On the sample complexity of consistent learning with one-sided error -- Complexity of computing Vapnik-Chervonenkis dimension -- ?-approximations of k-label spaces -- Exact learning of linear combinations of monotone terms from function value queries -- Thue systems and DNA — A learning algorithm for a subclass -- The VC-dimensions of finite automata with n states -- Unifying learning methods by colored digraphs -- A perceptual criterion for visually controlling learning -- Learning strategies using decision lists -- A decomposition based induction model for discovering concept clusters from databases -- Algebraic structure of some learning systems -- Induction of probabilistic rules based on rough set theory. |
Record Nr. | UNISA-996466054403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Grammatical Inference: Algorithms and Applications [[electronic resource] ] : 8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006, Proceedings / / edited by Yasibumi Sakaibara, Satoshi Kobayashi, Kengo Sato, Tetsuro Nishino, Etsuji Tomita |
Edizione | [1st ed. 2006.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
Descrizione fisica | 1 online resource (XII, 359 p.) |
Disciplina | 005.13/1 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Programming languages (Electronic computers)
Artificial intelligence Mathematical logic Computer logic Programming Languages, Compilers, Interpreters Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs |
ISBN | 3-540-45265-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Parsing Without Grammar Rules -- Classification of Biological Sequences with Kernel Methods -- Regular Papers -- Identification in the Limit of Systematic-Noisy Languages -- Ten Open Problems in Grammatical Inference -- Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data -- PAC-Learning Unambiguous NTS Languages -- Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets -- Variational Bayesian Grammar Induction for Natural Language -- Stochastic Analysis of Lexical and Semantic Enhanced Structural Language Model -- Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference -- Learning Analysis by Reduction from Positive Data -- Inferring Grammars for Mildly Context Sensitive Languages in Polynomial-Time -- Planar Languages and Learnability -- A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data -- Protein Motif Prediction by Grammatical Inference -- Grammatical Inference in Practice: A Case Study in the Biomedical Domain -- Inferring Grammar Rules of Programming Language Dialects -- The Tenjinno Machine Translation Competition -- Large Scale Inference of Deterministic Transductions: Tenjinno Problem 1 -- A Discriminative Model of Stochastic Edit Distance in the Form of a Conditional Transducer -- Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples -- Learning Multiplicity Tree Automata -- Learning DFA from Correction and Equivalence Queries -- Using MDL for Grammar Induction -- Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses -- Learning Deterministic DEC Grammars Is Learning Rational Numbers -- Iso-array Acceptors and Learning -- Poster Papers -- A Merging States Algorithm for Inference of RFSAs -- Query-Based Learning of XPath Expressions -- Learning Finite-State Machines from Inexperienced Teachers -- Suprasymbolic Grammar Induction by Recurrent Self-Organizing Maps -- Graph-Based Structural Data Mining in Cognitive Pattern Interpretation -- Constructing Song Syntax by Automata Induction -- Learning Reversible Languages with Terminal Distinguishability -- Grammatical Inference for Syntax-Based Statistical Machine Translation. |
Record Nr. | UNISA-996466147703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
WALCOM: Algorithms and Computation [[electronic resource] ] : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings / / edited by M. Sohel Rahman, Etsuji Tomita |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (XXIV, 336 p. 110 illus.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer graphics Discrete Mathematics in Computer Science Mathematical Applications in Computer Science Symbolic and Algebraic Manipulation Computer Graphics |
ISBN | 3-319-15612-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Encoding Data Structures -- Fast Algorithms for Constrained Graph Density Problems -- The Directed Ring Loading with Penalty Cost -- Edge-Colorings of Weighted Graphs (Extended Abstract) -- Unit Covering in Color-Spanning Set Model -- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem -- A Practical Succinct Data Structure for Tree-Like Graphs -- Forming Plurality at Minimum Cost -- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs -- Straight-Path Queries in Trajectory Data -- Folding a Paper Strip to Minimize Thickness -- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract) -- PTAS’s for Some Metric p-source Communication Spanning Tree Problems -- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement -- Enumerating Eulerian Trails via Hamiltonian Path Enumeration -- The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees -- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks -- Dynamic Online Multiselection in Internal and External Memory -- Competitive Analysis for Multi-objective Online Algorithms -- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends -- An Improved Algorithm for Parameterized Edge Dominating Set Problem -- On Bar (1, j)-Visibility Graphs (Extended Abstract) -- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs -- Non-repetitive Strings over Alphabet Lists -- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes -- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid -- Threshold Circuits for Global Patterns in 2-Dimensional Maps -- Superset Generation on Decision Diagrams -- On Triangle Cover Contact Graphs -- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs. |
Record Nr. | UNISA-996198744003316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
WALCOM: Algorithms and Computation : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings / / edited by M. Sohel Rahman, Etsuji Tomita |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (XXIV, 336 p. 110 illus.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer graphics Discrete Mathematics in Computer Science Mathematical Applications in Computer Science Symbolic and Algebraic Manipulation Computer Graphics |
ISBN | 3-319-15612-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Encoding Data Structures -- Fast Algorithms for Constrained Graph Density Problems -- The Directed Ring Loading with Penalty Cost -- Edge-Colorings of Weighted Graphs (Extended Abstract) -- Unit Covering in Color-Spanning Set Model -- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem -- A Practical Succinct Data Structure for Tree-Like Graphs -- Forming Plurality at Minimum Cost -- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs -- Straight-Path Queries in Trajectory Data -- Folding a Paper Strip to Minimize Thickness -- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract) -- PTAS’s for Some Metric p-source Communication Spanning Tree Problems -- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement -- Enumerating Eulerian Trails via Hamiltonian Path Enumeration -- The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees -- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks -- Dynamic Online Multiselection in Internal and External Memory -- Competitive Analysis for Multi-objective Online Algorithms -- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends -- An Improved Algorithm for Parameterized Edge Dominating Set Problem -- On Bar (1, j)-Visibility Graphs (Extended Abstract) -- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs -- Non-repetitive Strings over Alphabet Lists -- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes -- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid -- Threshold Circuits for Global Patterns in 2-Dimensional Maps -- Superset Generation on Decision Diagrams -- On Triangle Cover Contact Graphs -- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs. |
Record Nr. | UNINA-9910484540503321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|