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 : 10th International Conference, ALT'99, Tokyo, Japan, December 6-8, 1999 : proceedings / / Osamu Watanabe, Takashi Yokomori, eds
| Algorithmic learning theory : 10th International Conference, ALT'99, Tokyo, Japan, December 6-8, 1999 : proceedings / / Osamu Watanabe, Takashi Yokomori, eds |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (374 p.) |
| Disciplina | 006.3/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Machine learning
Computer algorithms |
| ISBN |
1-280-80456-4
9786610804566 3-540-46769-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 Unions of Pattern Languages and Tree Patterns. |
| Record Nr. | UNISA-996465614103316 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory : 10th International Conference, ALT '99 Tokyo, Japan, December 6-8, 1999 Proceedings / / edited by Osamu Watanabe, Takashi Yokomori
| Algorithmic Learning Theory : 10th International Conference, ALT '99 Tokyo, Japan, December 6-8, 1999 Proceedings / / edited by Osamu Watanabe, Takashi Yokomori |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1999 |
| Descrizione fisica | 1 online resource (374 p.) |
| Disciplina | 006.3/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Machine theory Algorithms Artificial Intelligence Formal Languages and Automata Theory |
| ISBN |
1-280-80456-4
9786610804566 3-540-46769-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910767545003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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
| 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 | ||
| ||
DNA Computing [[electronic resource] ] : 12th International Meeting on DNA Computing, DNA12, Seoul, Korea, June 5-9, 2006, Revised Selected Papers / / edited by Chengde Mao, Takashi Yokomori
| DNA Computing [[electronic resource] ] : 12th International Meeting on DNA Computing, DNA12, Seoul, Korea, June 5-9, 2006, Revised Selected Papers / / edited by Chengde Mao, Takashi Yokomori |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XII, 440 p.) |
| Disciplina | 621.39/1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Bioinformatics Artificial intelligence Theory of Computation Computational and Systems Biology Artificial Intelligence |
| ISBN | 3-540-68423-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Molecular and Membrane Computing Models -- Computing with Spiking Neural P Systems: Traces and Small Universal Systems -- Minimal Parallelism for Polarizationless P Systems -- P Systems with Active Membranes Characterize PSPACE -- All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size -- Length-Separating Test Tube Systems -- Gene Assembly Algorithms for Ciliates -- Complexity Analysis -- Spectrum of a Pot for DNA Complexes -- On the Complexity of Graph Self-assembly in Accretive Systems -- Viral Genome Compression -- Sequence and Tile Designs and Their Properties -- DNA Codes and Their Properties -- In Search of Optimal Codes for DNA Computing -- DNA Sequence Design by Dynamic Neighborhood Searches -- Sequence Design for Stable DNA Tiles -- Hairpin Structures Defined by DNA Trajectories -- DNA Tile Self-assembly Models -- Design and Simulation of Self-repairing DNA Lattices -- On Times to Compute Shapes in 2D Tile Self-assembly -- Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions -- A Mathematical Approach to Cross-Linked Structures in Viral Capsids: Predicting the Architecture of Novel Containers for Drug Delivery -- Simulator and Software for DNA Computing -- A Framework for Modeling DNA Based Molecular Systems -- Uniquimer: A de Novo DNA Sequence Generation Computer Software for DNA Self-assembly -- A Probabilistic Model of the DNA Conformational Change -- Simulations of Microreactors: The Order of Things -- DNA Computing Algorithms and New Applications -- DNA Hypernetworks for Information Storage and Retrieval -- Abstraction Layers for Scalable Microfluidic Biocomputers -- Fuzzy Forecasting with DNA Computing -- “Reasoning” and “Talking” DNA: Can DNA Understand English? -- Novel Experimental Approaches -- A New Readout Approach in DNA Computing Based on Real-Time PCR with TaqMan Probes -- Automating the DNA Computer: Solving n-Variable 3-SAT Problems -- Local Area Manipulation of DNA Molecules for Photonic DNA Memory -- Experimental Solutions -- Unravel Four Hairpins! -- Displacement Whiplash PCR: Optimized Architecture and Experimental Validation -- MethyLogic: Implementation of Boolean Logic Using DNA Methylation -- Development of DNA Relational Database and Data Manipulation Experiments -- Experimental Validation of the Statistical Thermodynamic Model for Prediction of the Behavior of Autonomous Molecular Computers Based on DNA Hairpin Formation. |
| Record Nr. | UNISA-996466272203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
DNA computing : 12th International Meeting on DNA Computing, DNA12, Seoul, Korea, June 5-9, 2006 : revised selected papers / / Chengde Mao, Takashi Yokomori (eds.)
| DNA computing : 12th International Meeting on DNA Computing, DNA12, Seoul, Korea, June 5-9, 2006 : revised selected papers / / Chengde Mao, Takashi Yokomori (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2006 |
| Descrizione fisica | 1 online resource (XII, 440 p.) |
| Disciplina | 621.39/1 |
| Altri autori (Persone) |
MaoChengde
YokomoriTakashi |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico | Molecular computers |
| ISBN | 3-540-68423-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Molecular and Membrane Computing Models -- Computing with Spiking Neural P Systems: Traces and Small Universal Systems -- Minimal Parallelism for Polarizationless P Systems -- P Systems with Active Membranes Characterize PSPACE -- All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size -- Length-Separating Test Tube Systems -- Gene Assembly Algorithms for Ciliates -- Complexity Analysis -- Spectrum of a Pot for DNA Complexes -- On the Complexity of Graph Self-assembly in Accretive Systems -- Viral Genome Compression -- Sequence and Tile Designs and Their Properties -- DNA Codes and Their Properties -- In Search of Optimal Codes for DNA Computing -- DNA Sequence Design by Dynamic Neighborhood Searches -- Sequence Design for Stable DNA Tiles -- Hairpin Structures Defined by DNA Trajectories -- DNA Tile Self-assembly Models -- Design and Simulation of Self-repairing DNA Lattices -- On Times to Compute Shapes in 2D Tile Self-assembly -- Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions -- A Mathematical Approach to Cross-Linked Structures in Viral Capsids: Predicting the Architecture of Novel Containers for Drug Delivery -- Simulator and Software for DNA Computing -- A Framework for Modeling DNA Based Molecular Systems -- Uniquimer: A de Novo DNA Sequence Generation Computer Software for DNA Self-assembly -- A Probabilistic Model of the DNA Conformational Change -- Simulations of Microreactors: The Order of Things -- DNA Computing Algorithms and New Applications -- DNA Hypernetworks for Information Storage and Retrieval -- Abstraction Layers for Scalable Microfluidic Biocomputers -- Fuzzy Forecasting with DNA Computing -- “Reasoning” and “Talking” DNA: Can DNA Understand English? -- Novel Experimental Approaches -- A New Readout Approach in DNA Computing Based on Real-Time PCR with TaqMan Probes -- Automating the DNA Computer: Solving n-Variable 3-SAT Problems -- Local Area Manipulation of DNA Molecules for Photonic DNA Memory -- Experimental Solutions -- Unravel Four Hairpins! -- Displacement Whiplash PCR: Optimized Architecture and Experimental Validation -- MethyLogic: Implementation of Boolean Logic Using DNA Methylation -- Development of DNA Relational Database and Data Manipulation Experiments -- Experimental Validation of the Statistical Thermodynamic Model for Prediction of the Behavior of Autonomous Molecular Computers Based on DNA Hairpin Formation. |
| Altri titoli varianti |
12th International Meeting on DNA Computing
Twelfth International Meeting on DNA Computing International Meeting on DNA Computing DNA 12 DNA twelve |
| Record Nr. | UNINA-9910483451403321 |
| Berlin ; ; New York, : Springer, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||