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.
Theory and Applications of Models of Computation [[electronic resource] ] : 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings / / edited by T V Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper
| Theory and Applications of Models of Computation [[electronic resource] ] : 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings / / edited by T V Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIV, 423 p. 75 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer science—Mathematics Algorithms Data structures (Computer science) Information theory Machine theory Theory of Computation Mathematics of Computing Computer Science Logic and Foundations of Programming Data Structures and Information Theory Formal Languages and Automata Theory |
| ISBN | 3-319-06089-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Roadmap for TAMC -- A tight lower bound instance for k-means++ in constant dimension -- An improved Upper-bound for Rivest et al.’s Half-lie Problem -- Reversibility of Elementary Cellular Automata Under Fully Asynchronous Update -- Finite State Incompressible Infinite Sequences -- Finding optimal strategies of almost acyclic Simple Stochastic Games -- The Parameterized Complexity of Domination-type Problems and Application to Linear Codes -- On representations of abstract systems with partial inputs and outputs -- Complexity Information Flow in a Multi-threaded Imperative Language -- An Incremental Algorithm for Computing Prime Implicates in Modal Logic -- Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-like Set Systems -- space complexity of optimization problems in planar graphs -- Fine Tuning Decomposition Theorem for Maximum Weight Bipartite Matching -- Intersection Dimension of Bipartite Graphs -- On the Parameterized Complexity for Token Jumping on Graphs -- More on Universality of Spiking Neural P Systems with Anti-Spikes -- Modular Form Approach to Solving Lattice Problems. |
| Record Nr. | UNISA-996203623703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Models of Computation : 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings / / edited by T V Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper
| Theory and Applications of Models of Computation : 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings / / edited by T V Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIV, 423 p. 75 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer science—Mathematics Algorithms Data structures (Computer science) Information theory Machine theory Theory of Computation Mathematics of Computing Computer Science Logic and Foundations of Programming Data Structures and Information Theory Formal Languages and Automata Theory |
| ISBN | 3-319-06089-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Roadmap for TAMC -- A tight lower bound instance for k-means++ in constant dimension -- An improved Upper-bound for Rivest et al.’s Half-lie Problem -- Reversibility of Elementary Cellular Automata Under Fully Asynchronous Update -- Finite State Incompressible Infinite Sequences -- Finding optimal strategies of almost acyclic Simple Stochastic Games -- The Parameterized Complexity of Domination-type Problems and Application to Linear Codes -- On representations of abstract systems with partial inputs and outputs -- Complexity Information Flow in a Multi-threaded Imperative Language -- An Incremental Algorithm for Computing Prime Implicates in Modal Logic -- Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-like Set Systems -- space complexity of optimization problems in planar graphs -- Fine Tuning Decomposition Theorem for Maximum Weight Bipartite Matching -- Intersection Dimension of Bipartite Graphs -- On the Parameterized Complexity for Token Jumping on Graphs -- More on Universality of Spiking Neural P Systems with Anti-Spikes -- Modular Form Approach to Solving Lattice Problems. |
| Record Nr. | UNINA-9910483672403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings / / edited by Manindra Agrawal, Barry S. Cooper, Angsheng Li
| Theory and Applications of Models of Computation [[electronic resource] ] : 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings / / edited by Manindra Agrawal, Barry S. Cooper, Angsheng Li |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XV, 622 p. 91 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer science—Mathematics Algorithms Data structures (Computer science) Information theory Machine theory Theory of Computation Mathematics of Computing Computer Science Logic and Foundations of Programming Data Structures and Information Theory Formal Languages and Automata Theory |
| ISBN | 3-642-29952-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465776103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings / / edited by Jan Kratochvil, Angsheng Li, Jiri Fiala, Petr Kolman
| Theory and Applications of Models of Computation [[electronic resource] ] : 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings / / edited by Jan Kratochvil, Angsheng Li, Jiri Fiala, Petr Kolman |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIV, 480 p. 91 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Compilers (Computer programs) Computer science Computer science—Mathematics Algorithms Programming Techniques Compilers and Interpreters Theory of Computation Mathematics of Computing Computer Science Logic and Foundations of Programming |
| ISBN |
1-280-38709-2
9786613565013 3-642-13562-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Plenary Talks -- New Research Directions in the Information Age -- The Laplacian Paradigm: Emerging Algorithms for Massive Graphs -- Special Sessions -- Proof Complexity of Non-classical Logics -- Optimal Acceptors and Optimal Proof Systems -- The Complexity of Geometric Problems in High Dimension -- Different Approaches to Proof Systems -- Algebraic Proofs over Noncommutative Formulas -- Contributed Papers -- Nonlocal Quantum XOR Games for Large Number of Players -- Nontriviality for Exponential Time w.r.t. Weak Reducibilities -- Streaming Algorithms for Some Problems in Log-Space -- Temperature Aware Online Scheduling with a Low Cooling Factor -- On Solution Concepts for Matching Games -- Binary De Bruijn Partial Words with One Hole -- Complexity Invariance of Real Interpretations -- Pivot and Loop Complementation on Graphs and Set Systems -- Revisiting the Minimum Breakpoint Linearization Problem -- An -time Algorithm for the Minimal Interval Completion Problem -- Centdian Computation for Sensor Networks -- Twisted Jacobi Intersections Curves -- L(2,1,1)-Labeling Is NP-Complete for Trees -- Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs -- The Max k-Cut Game and Its Strong Equilibria -- Kernel and Fast Algorithm for Dense Triplet Inconsistency -- Incremental List Coloring of Graphs, Parameterized by Conservation -- Schnyder Greedy Routing Algorithm -- Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width -- A Note on the Testability of Ramsey’s Class -- Deterministic Polynomial-Time Algorithms for Designing Short DNA Words -- Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult -- A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions -- Graph Sharing Games: Complexity and Connectivity -- A Visual Model of Computation -- An Automata-Theoretic Characterization of the Chomsky-Hierarchy -- Maximum Independent Set in Graphs of Average Degree at Most Three in -- Simultaneity in Event Structures -- Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable -- Closed Rectangle-of-Influence Drawings for Irreducible Triangulations -- Recovering Social Networks from Contagion Information -- Two-Layer Planarization Parameterized by Feedback Edge Set -- A Categorical View of Timed Weak Bisimulation -- Community Structure in Large Complex Networks -- Generating Internally Triconnected Rooted Plane Graphs. |
| Record Nr. | UNISA-996465949003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings / / edited by Jan Kratochvil, Angsheng Li, Jiri Fiala, Petr Kolman
| Theory and Applications of Models of Computation [[electronic resource] ] : 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings / / edited by Jan Kratochvil, Angsheng Li, Jiri Fiala, Petr Kolman |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIV, 480 p. 91 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Compilers (Computer programs) Computer science Computer science—Mathematics Algorithms Programming Techniques Compilers and Interpreters Theory of Computation Mathematics of Computing Computer Science Logic and Foundations of Programming |
| ISBN |
1-280-38709-2
9786613565013 3-642-13562-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Plenary Talks -- New Research Directions in the Information Age -- The Laplacian Paradigm: Emerging Algorithms for Massive Graphs -- Special Sessions -- Proof Complexity of Non-classical Logics -- Optimal Acceptors and Optimal Proof Systems -- The Complexity of Geometric Problems in High Dimension -- Different Approaches to Proof Systems -- Algebraic Proofs over Noncommutative Formulas -- Contributed Papers -- Nonlocal Quantum XOR Games for Large Number of Players -- Nontriviality for Exponential Time w.r.t. Weak Reducibilities -- Streaming Algorithms for Some Problems in Log-Space -- Temperature Aware Online Scheduling with a Low Cooling Factor -- On Solution Concepts for Matching Games -- Binary De Bruijn Partial Words with One Hole -- Complexity Invariance of Real Interpretations -- Pivot and Loop Complementation on Graphs and Set Systems -- Revisiting the Minimum Breakpoint Linearization Problem -- An -time Algorithm for the Minimal Interval Completion Problem -- Centdian Computation for Sensor Networks -- Twisted Jacobi Intersections Curves -- L(2,1,1)-Labeling Is NP-Complete for Trees -- Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs -- The Max k-Cut Game and Its Strong Equilibria -- Kernel and Fast Algorithm for Dense Triplet Inconsistency -- Incremental List Coloring of Graphs, Parameterized by Conservation -- Schnyder Greedy Routing Algorithm -- Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width -- A Note on the Testability of Ramsey’s Class -- Deterministic Polynomial-Time Algorithms for Designing Short DNA Words -- Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult -- A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions -- Graph Sharing Games: Complexity and Connectivity -- A Visual Model of Computation -- An Automata-Theoretic Characterization of the Chomsky-Hierarchy -- Maximum Independent Set in Graphs of Average Degree at Most Three in -- Simultaneity in Event Structures -- Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable -- Closed Rectangle-of-Influence Drawings for Irreducible Triangulations -- Recovering Social Networks from Contagion Information -- Two-Layer Planarization Parameterized by Feedback Edge Set -- A Categorical View of Timed Weak Bisimulation -- Community Structure in Large Complex Networks -- Generating Internally Triconnected Rooted Plane Graphs. |
| Record Nr. | UNINA-9910483997703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings / / edited by Jin-Yi Cai, Barry S. Cooper, Angsheng Li
| Theory and Applications of Models of Computation [[electronic resource] ] : Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings / / edited by Jin-Yi Cai, Barry S. Cooper, Angsheng Li |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XVI, 800 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Artificial intelligence Computer science—Mathematics Bioinformatics Theory of Computation Artificial Intelligence Mathematics of Computing |
| ISBN | 3-540-34022-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Plenary Lectures -- On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance -- Similarity of Objects and the Meaning of Words -- Totally ? ? Computably Enumerable and m-topped Degrees -- Mitosis in Computational Complexity -- Models of Intuitionistic Set Theories over Partial Combinatory Algebras -- Width Versus Size in Resolution Proofs -- Recent Progress in Quantum Computational Complexity -- Algorithm -- On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times -- LS-SVM Based on Chaotic Particle Swarm Optimization with Simulated Annealing -- A Bounded Item Bin Packing Problem over Discrete Distribution -- Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms -- Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges -- An ACO-Based Approach for Task Assignment and Scheduling of Multiprocessor Control Systems -- Adversary Immune Size Approximation of Single-Hop Radio Networks -- On Load-Balanced Semi-matchings for Weighted Bipartite Graphs -- Analyzing Chain Programs over Difference Constraints -- Linear-Time 2-Approximation Algorithm for the Watchman Route Problem -- Further Properties of Cayley Digraphs and Their Applications to Interconnection Networks -- Real Time Critical Edge of the Shortest Path in Transportation Networks -- Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations -- A New Approximation Algorithm for the k-Facility Location Problem -- Computational Complexity -- Alternative Measures of Computational Complexity with Applications to Agnostic Learning -- Disjoint NP-Pairs from Propositional Proof Systems -- Valiant’s Holant Theorem and Matchgate Tensors -- Variable Minimal Unsatisfiability -- A New Lower Bound of Critical Function for (k,s)-SAT -- Cluster Computing and the Power of Edge Recognition -- Quadratic Lower Bounds on Matrix Rigidity -- Non-reducible Descriptions for Conditional Kolmogorov Complexity -- Generalized Counters and Reversal Complexity -- Multisource Algorithmic Information Theory -- Block Sensitivity of Weakly Symmetric Functions -- Optimization Problems in the Polynomial-Time Hierarchy -- #3-Regular Bipartite Planar Vertex Cover is #P-Complete -- Group Theory Based Synthesis of Binary Reversible Circuits -- On Some Complexity Issues of NC Analytic Functions -- Learning Theory -- Learning Juntas in the Presence of Noise -- Grey Reinforcement Learning for Incomplete Information Processing -- On the Foundations of Universal Sequence Prediction -- Some Recent Results in U-Shaped Learning -- Learning Overcomplete Representations with a Generalized Gaussian Prior -- On PAC Learning Algorithms for Rich Boolean Function Classes -- On-Line Regression Competitive with Reproducing Kernel Hilbert Spaces -- Inductive Inference and Language Learning -- Time Series Predictions Using Multi-scale Support Vector Regressions -- Bioinformatics -- Identification and Comparison of Motifs in Brain-Specific and Muscle-Specific Alternative Splicing -- On Probe Permutation Graphs -- Automatic Classification of Protein Structures Based on Convex Hull Representation by Integrated Neural Network -- Protein Structure Comparison Based on a Measure of Information Discrepancy -- Succinct Text Indexes on Large Alphabet -- Security -- Identity-Based Threshold Proxy Signature Scheme with Known Signers -- Secure Computations in a Minimal Model Using Multiple-Valued ESOP Expressions -- Formal Method -- Towards Practical Computable Functions on Context-Free Languages -- The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces -- Analysis of Properties of Petri Synthesis Net -- A Tree Construction of the Preferable Answer Sets for Prioritized Basic Disjunctive Logic Programs -- Object-Oriented Specification Composition and Refinement Via Category Theoretic Computations -- Improved SAT Based Bounded Model Checking -- Models of Computation -- Encodings and Arithmetic Operations in Membrane Computing -- The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation -- Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable -- The Trade-Off Theorem and Fragments of Gödel’s T -- On Non-binary Quantum BCH Codes -- Maximal Models of Assertion Graph in GSTE -- Computatability -- Immunity Properties and the n-C.E. Hierarchy -- On Rogers Semilattices -- Invertible Classes -- Universal Cupping Degrees -- On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal -- Enumeration Degrees of the Bounded Total Sets -- A Generic Set That Does Not Bound a Minimal Pair -- Lowness for Weakly 1-generic and Kurtz-Random -- On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies -- Computable Mathematics -- On Mass Problems of Presentability -- Beyond the First Main Theorem – When Is the Solution of a Linear Cauchy Problem Computable?. |
| Record Nr. | UNISA-996465935403316 |
| 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] ] : Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings / / edited by Jin-Yi Cai, Barry S. Cooper, Angsheng Li
| Theory and Applications of Models of Computation [[electronic resource] ] : Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings / / edited by Jin-Yi Cai, Barry S. Cooper, Angsheng Li |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XVI, 800 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Artificial intelligence Computer science—Mathematics Bioinformatics Theory of Computation Artificial Intelligence Mathematics of Computing |
| ISBN | 3-540-34022-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Plenary Lectures -- On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance -- Similarity of Objects and the Meaning of Words -- Totally ? ? Computably Enumerable and m-topped Degrees -- Mitosis in Computational Complexity -- Models of Intuitionistic Set Theories over Partial Combinatory Algebras -- Width Versus Size in Resolution Proofs -- Recent Progress in Quantum Computational Complexity -- Algorithm -- On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times -- LS-SVM Based on Chaotic Particle Swarm Optimization with Simulated Annealing -- A Bounded Item Bin Packing Problem over Discrete Distribution -- Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms -- Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges -- An ACO-Based Approach for Task Assignment and Scheduling of Multiprocessor Control Systems -- Adversary Immune Size Approximation of Single-Hop Radio Networks -- On Load-Balanced Semi-matchings for Weighted Bipartite Graphs -- Analyzing Chain Programs over Difference Constraints -- Linear-Time 2-Approximation Algorithm for the Watchman Route Problem -- Further Properties of Cayley Digraphs and Their Applications to Interconnection Networks -- Real Time Critical Edge of the Shortest Path in Transportation Networks -- Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations -- A New Approximation Algorithm for the k-Facility Location Problem -- Computational Complexity -- Alternative Measures of Computational Complexity with Applications to Agnostic Learning -- Disjoint NP-Pairs from Propositional Proof Systems -- Valiant’s Holant Theorem and Matchgate Tensors -- Variable Minimal Unsatisfiability -- A New Lower Bound of Critical Function for (k,s)-SAT -- Cluster Computing and the Power of Edge Recognition -- Quadratic Lower Bounds on Matrix Rigidity -- Non-reducible Descriptions for Conditional Kolmogorov Complexity -- Generalized Counters and Reversal Complexity -- Multisource Algorithmic Information Theory -- Block Sensitivity of Weakly Symmetric Functions -- Optimization Problems in the Polynomial-Time Hierarchy -- #3-Regular Bipartite Planar Vertex Cover is #P-Complete -- Group Theory Based Synthesis of Binary Reversible Circuits -- On Some Complexity Issues of NC Analytic Functions -- Learning Theory -- Learning Juntas in the Presence of Noise -- Grey Reinforcement Learning for Incomplete Information Processing -- On the Foundations of Universal Sequence Prediction -- Some Recent Results in U-Shaped Learning -- Learning Overcomplete Representations with a Generalized Gaussian Prior -- On PAC Learning Algorithms for Rich Boolean Function Classes -- On-Line Regression Competitive with Reproducing Kernel Hilbert Spaces -- Inductive Inference and Language Learning -- Time Series Predictions Using Multi-scale Support Vector Regressions -- Bioinformatics -- Identification and Comparison of Motifs in Brain-Specific and Muscle-Specific Alternative Splicing -- On Probe Permutation Graphs -- Automatic Classification of Protein Structures Based on Convex Hull Representation by Integrated Neural Network -- Protein Structure Comparison Based on a Measure of Information Discrepancy -- Succinct Text Indexes on Large Alphabet -- Security -- Identity-Based Threshold Proxy Signature Scheme with Known Signers -- Secure Computations in a Minimal Model Using Multiple-Valued ESOP Expressions -- Formal Method -- Towards Practical Computable Functions on Context-Free Languages -- The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces -- Analysis of Properties of Petri Synthesis Net -- A Tree Construction of the Preferable Answer Sets for Prioritized Basic Disjunctive Logic Programs -- Object-Oriented Specification Composition and Refinement Via Category Theoretic Computations -- Improved SAT Based Bounded Model Checking -- Models of Computation -- Encodings and Arithmetic Operations in Membrane Computing -- The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation -- Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable -- The Trade-Off Theorem and Fragments of Gödel’s T -- On Non-binary Quantum BCH Codes -- Maximal Models of Assertion Graph in GSTE -- Computatability -- Immunity Properties and the n-C.E. Hierarchy -- On Rogers Semilattices -- Invertible Classes -- Universal Cupping Degrees -- On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal -- Enumeration Degrees of the Bounded Total Sets -- A Generic Set That Does Not Bound a Minimal Pair -- Lowness for Weakly 1-generic and Kurtz-Random -- On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies -- Computable Mathematics -- On Mass Problems of Presentability -- Beyond the First Main Theorem – When Is the Solution of a Linear Cauchy Problem Computable?. |
| Record Nr. | UNINA-9910484970903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||