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.
Local Features in Natural Images via Singularity Theory [[electronic resource] /] / by James Damon, Peter Giblin, Gareth Haslinger
| Local Features in Natural Images via Singularity Theory [[electronic resource] /] / by James Damon, Peter Giblin, Gareth Haslinger |
| Autore | Damon James |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (X, 255 p. 107 illus., 50 illus. in color.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Mathematics |
| Soggetto topico |
Global analysis (Mathematics)
Manifolds (Mathematics) Computer science—Mathematics Computer mathematics Optical data processing Global Analysis and Analysis on Manifolds Mathematical Applications in Computer Science Computer Imaging, Vision, Pattern Recognition and Graphics |
| ISBN | 3-319-41471-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Overview -- Part I-Mathematical Basis for Analysis of Feature-Shade/Shadow- Contours -- Abstract Classification of Singularities Preserving Features -- Singularity Equivalence Groups Capturing Interactions -- Methods for Classification of Singularities -- Methods for Topological Classification of Singularities -- Part II-The Classification of Interactions Involving Feature– Shade/Shadow–Contours -- Stratifications of Generically Illuminated Surfaces with Geometric Features -- Realizations of Abstract Mappings Representing Projection Singularities -- Statements of the Main Classification Results -- Part III-Classifications of Interactions of Pairs of Feature– Shade/Shadow–Contours -- Stable View Projections and Transitions involving Shade/Shadow Curves on a Smooth Surface (SC) -- Transitions involving Views of Geometric Features (FC) -- Part IV-Classifications of Multiple Interactions -- Transitions involving Geometric Features and Shade/Shadow Curves (SFC) -- Classifications of Stable Multilocal Configurations and Their Generic Transitions -- Bibliography. |
| Record Nr. | UNINA-9910136471303321 |
Damon James
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Local Features in Natural Images via Singularity Theory [[electronic resource] /] / by James Damon, Peter Giblin, Gareth Haslinger
| Local Features in Natural Images via Singularity Theory [[electronic resource] /] / by James Damon, Peter Giblin, Gareth Haslinger |
| Autore | Damon James |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (X, 255 p. 107 illus., 50 illus. in color.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Mathematics |
| Soggetto topico |
Global analysis (Mathematics)
Manifolds (Mathematics) Computer science—Mathematics Computer mathematics Optical data processing Global Analysis and Analysis on Manifolds Mathematical Applications in Computer Science Computer Imaging, Vision, Pattern Recognition and Graphics |
| ISBN | 3-319-41471-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Overview -- Part I-Mathematical Basis for Analysis of Feature-Shade/Shadow- Contours -- Abstract Classification of Singularities Preserving Features -- Singularity Equivalence Groups Capturing Interactions -- Methods for Classification of Singularities -- Methods for Topological Classification of Singularities -- Part II-The Classification of Interactions Involving Feature– Shade/Shadow–Contours -- Stratifications of Generically Illuminated Surfaces with Geometric Features -- Realizations of Abstract Mappings Representing Projection Singularities -- Statements of the Main Classification Results -- Part III-Classifications of Interactions of Pairs of Feature– Shade/Shadow–Contours -- Stable View Projections and Transitions involving Shade/Shadow Curves on a Smooth Surface (SC) -- Transitions involving Views of Geometric Features (FC) -- Part IV-Classifications of Multiple Interactions -- Transitions involving Geometric Features and Shade/Shadow Curves (SFC) -- Classifications of Stable Multilocal Configurations and Their Generic Transitions -- Bibliography. |
| Record Nr. | UNISA-996466477503316 |
|
Damon James
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Machine Learning [[electronic resource] ] : A Practical Approach on the Statistical Learning Theory / / by RODRIGO F MELLO, Moacir Antonelli Ponti
| Machine Learning [[electronic resource] ] : A Practical Approach on the Statistical Learning Theory / / by RODRIGO F MELLO, Moacir Antonelli Ponti |
| Autore | F MELLO RODRIGO |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XV, 362 p. 190 illus.) |
| Disciplina | 006.31 |
| Soggetto topico |
Artificial intelligence
Mathematical statistics Computer science—Mathematics Computer mathematics Statistics Artificial Intelligence Probability and Statistics in Computer Science Mathematical Applications in Computer Science Applied Statistics |
| ISBN | 3-319-94989-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter 1 – A Brief Review on Machine Learning -- Chapter 2 - Statistical Learning Theory -- Chapter 3 - Assessing Learning Algorithms -- Chapter 4 - Introduction to Support Vector Machines -- Chapter 5 - In Search for the Optimization Algorithm -- Chapter 6 - A Brief Introduction on Kernels -- . |
| Record Nr. | UNINA-9910299359803321 |
|
F MELLO RODRIGO
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Making Smart Cities More Playable [[electronic resource] ] : Exploring Playable Cities / / edited by Anton Nijholt
| Making Smart Cities More Playable [[electronic resource] ] : Exploring Playable Cities / / edited by Anton Nijholt |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Singapore : , : Springer Singapore : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (374 pages) |
| Disciplina | 307.760285 |
| Collana | Gaming Media and Social Effects |
| Soggetto topico |
Computational intelligence
User interfaces (Computer systems) Computer science—Mathematics Computer mathematics Sociology, Urban Computer games—Programming Electrical engineering Computational Intelligence User Interfaces and Human Computer Interaction Mathematical Applications in Computer Science Urban Studies/Sociology Game Development Communications Engineering, Networks |
| ISBN | 981-13-9765-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910483793303321 |
| Singapore : , : Springer Singapore : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical Foundations of Advanced Informatics [[electronic resource] ] : Volume 1: Inductive Approaches / / by Bernhard Steffen, Oliver Rüthing, Michael Huth
| Mathematical Foundations of Advanced Informatics [[electronic resource] ] : Volume 1: Inductive Approaches / / by Bernhard Steffen, Oliver Rüthing, Michael Huth |
| Autore | Steffen Bernhard |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XXVII, 228 p. 29 illus., 7 illus. in color.) |
| Disciplina | 004.0151 |
| Soggetto topico |
Computer science—Mathematics
Computers Computer mathematics Software engineering Mathematics of Computing Theory of Computation Mathematical Applications in Computer Science Software Engineering/Programming and Operating Systems |
| ISBN | 3-319-68397-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Propositions and Sets -- Relations and Functions -- Inductive Definitions -- Inductive Proofs -- Inductive Approach: Potential, Limitations, and Pragmatics. |
| Record Nr. | UNINA-9910299270603321 |
|
Steffen Bernhard
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical Foundations of Computer Science 2012 [[electronic resource] ] : 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings / / edited by Branislav Rovan, Vladimiro Sassone, Peter Widmayer
| Mathematical Foundations of Computer Science 2012 [[electronic resource] ] : 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings / / edited by Branislav Rovan, Vladimiro Sassone, Peter Widmayer |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XV, 825 p. 102 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Machine theory Discrete Mathematics in Computer Science Numerical Analysis Data Science Formal Languages and Automata Theory Mathematical Applications in Computer Science |
| ISBN | 3-642-32589-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the Complexity of Ontological Reasoning under Disjunctive -- Existential Rules -- New Races in Parameterized Algorithmics -- Scott Is Always Simple -- Simple Models for Recursive Schemes -- Unordered Constraint Satisfaction Games -- A Polynomial-Time Algorithm for Computing the Maximum Common -- Subgraph of Outerplanar Graphs of Bounded Degree -- Reductions to the Set of Random Strings: The Resource-Bounded Case -- Approximate Graph Isomorphism -- Near-Optimal Expanding Generator Sets for Solvable Permutation Groups -- Generating Functions of Timed Languages -- The Robust Set Problem: Parameterized Complexity and Approximation -- Mortality for 2 × 2 Matrices Is NP-Hard -- Solving Counter Parity Games -- Drawing Planar Graphs on Points Inside a Polygon -- Smoothed Complexity Theory -- Abelian Pattern Avoidance in Partial Words -- The Complexity of Rerouting Shortest Paths -- Computing with Large Populations Using Interactions -- Pancake Flipping Is Hard -- In-place Heap Construction with Optimized Comparisons, Moves, and Cache -- A Dichotomy Theorem for Homomorphism -- On the Impact of Fair Best Response Dynamics -- When Trees Grow Low: Shrubs and Fast MSO1 -- Obtaining Planarity by Contracting Few Kernels for Edge Dominating Set -- Quasi-recognizable vs MSO Definable Languages of One-Dimensional -- Reversal Hierarchies for Small -- The Lower Reaches of Circuit Weakly-Synchronized Ground Tree Rewriting -- Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs -- Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games -- Maximum Cliques in Graphs with Small Intersection Number and Random Intersection -- Regularity Problems for Weak Pushdown ω-Automata and Games -- Computational Aspects of Cellular Automata on Countable Sofic Shifts -- On Two Stronger Versions of Dejean’s Conjecture -- A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments. |
| Record Nr. | UNISA-996465486703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Mathematical Foundations of Computer Science 2013 [[electronic resource] ] : 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013, Proceedings / / edited by Krishnendu Chatterjee, Jirí Sgall
| Mathematical Foundations of Computer Science 2013 [[electronic resource] ] : 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013, Proceedings / / edited by Krishnendu Chatterjee, Jirí Sgall |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVI, 854 p. 92 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Machine theory Discrete Mathematics in Computer Science Numerical Analysis Data Science Formal Languages and Automata Theory Mathematical Applications in Computer Science |
| ISBN | 3-642-40313-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Alternation Trading Proofs and Their Limitations -- Bin Packing Games with Selfish Items -- A Constructive Proof of the Topological Kruskal Theorem -- Prior-Free Auctions of Digital Goods -- Clustering on k-Edge-Colored Graphs -- How to Pack Your Items When You Have to Buy Your Knapsack.-Computing Behavioral Distances, Compositionally -- Rewriting Guarded Negation Queries -- Parity Games and Propositional Proofs -- Bringing Order to Special Cases of Klee’s Measure Problem -- Learning Reductions to Sparse Sets -- Probabilistic Automata with Isolated Cut-Points -- On Stochastic Games with Multiple Objectives -- Paradigms for Parameterized Enumeration -- Noninterference with Local Policies -- Ordering Metro Lines by Block Crossings -- Meta-kernelization with Structural Parameters -- Polynomial Threshold Functions and Boolean Threshold Circuits -- Detecting Regularities on Grammar-Compressed Strings -- An Unusual Temporal Logic. |
| Record Nr. | UNISA-996465710303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Mathematical Foundations of Computer Science 2013 [[electronic resource] ] : 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013, Proceedings / / edited by Krishnendu Chatterjee, Jirí Sgall
| Mathematical Foundations of Computer Science 2013 [[electronic resource] ] : 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013, Proceedings / / edited by Krishnendu Chatterjee, Jirí Sgall |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVI, 854 p. 92 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Machine theory Discrete Mathematics in Computer Science Numerical Analysis Data Science Formal Languages and Automata Theory Mathematical Applications in Computer Science |
| ISBN | 3-642-40313-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Alternation Trading Proofs and Their Limitations -- Bin Packing Games with Selfish Items -- A Constructive Proof of the Topological Kruskal Theorem -- Prior-Free Auctions of Digital Goods -- Clustering on k-Edge-Colored Graphs -- How to Pack Your Items When You Have to Buy Your Knapsack.-Computing Behavioral Distances, Compositionally -- Rewriting Guarded Negation Queries -- Parity Games and Propositional Proofs -- Bringing Order to Special Cases of Klee’s Measure Problem -- Learning Reductions to Sparse Sets -- Probabilistic Automata with Isolated Cut-Points -- On Stochastic Games with Multiple Objectives -- Paradigms for Parameterized Enumeration -- Noninterference with Local Policies -- Ordering Metro Lines by Block Crossings -- Meta-kernelization with Structural Parameters -- Polynomial Threshold Functions and Boolean Threshold Circuits -- Detecting Regularities on Grammar-Compressed Strings -- An Unusual Temporal Logic. |
| Record Nr. | UNINA-9910484745903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical Foundations of Computer Science 2014 [[electronic resource] ] : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 26-29, 2014. Proceedings, Part II / / edited by Ersébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik
| Mathematical Foundations of Computer Science 2014 [[electronic resource] ] : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 26-29, 2014. Proceedings, Part II / / edited by Ersébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXII, 640 p. 71 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Machine theory Discrete Mathematics in Computer Science Numerical Analysis Data Science Formal Languages and Automata Theory Mathematical Applications in Computer Science |
| ISBN | 3-662-44465-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Table of Contents - Volume II -- Algorithms, Complexity and Games -- On r-Simple k-Path -- Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs -- Zero Knowledge and Circuit Minimization -- A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity -- n)-Space and Polynomial-time Algorithm for Planar Directed Graph Reachability -- Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set -- Network-Based Dissolution -- On Unification of QBF Resolution-Based Calculi -- Minimum planar multi-sink cuts with connectivity priors -- The Price of Envy-Freeness in Machine Scheduling -- On the Complexity of Some Ordering Problems -- The Relationship Between Multiplicative Complexity and Nonlinearity -- Find Dual Connectedness of Edge-Bicolored Graphs and Beyond -- Combinatorial Voter Control in Elections -- An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas -- On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields -- Hitting forbidden subgraphs in graphs of bounded treewidth -- Probabilistic Analysis of Power Assignments -- Existence of Secure Equilibrium in Multi-Player Games with Perfect Information -- An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear group -- A Note on the Minimum Distance of Quantum LDPC Codes -- Minimum Bisection is NP-hard on Unit Disk Graphs -- Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty -- Streaming Kernelization -- A Reconfigurations Analogue of Brooks’ Theorem -- Intersection Graphs of L-Shapes and Segments in the Plane -- Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes -- Editing to a Connected Graph of Given Degrees -- Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth -- On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity -- New Results for Non-Preemptive Speed Scaling -- Lower bounds for splittings by linear combinations -- On the Complexity of List Ranking in the Parallel External Memory Model -- Knocking Out Pk-free Graphs -- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis -- Affine consistency and the complexity of semilinear constraints -- Small complexity classes for computable analysis -- Two Results about Quantum Messages -- Parameterized Approximations via d-Skew-Symmetric Multicut -- On the Clique Editing Problem -- On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic -- Computational Complexity of Covering Three-Vertex Multigraphs -- Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs -- On Coloring Resilient Graphs -- Document Retrieval with One Wildcard -- An Hn=2 Upper Bound on the Price of Stability of Undirected Network Design Games -- Traveling Salesman Problems in Temporal Graphs -- Inferring Strings from Lyndon factorization -- Betweenness Centrality - Incremental and Faster -- Deterministic Parameterized Algorithms for the Graph Motif Problem -- The Two Queries Assumption and Arthur-Merlin Classes -- Flexible Bandwidth Assignment with Application to Optical Networks -- Approximation Algorithms For Bounded Color Matchings via Convex Decompositions. |
| Record Nr. | UNISA-996198257903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Mathematical Foundations of Computer Science 2014 [[electronic resource] ] : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 26-29, 2014. Proceedings, Part I / / edited by Ersébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik
| Mathematical Foundations of Computer Science 2014 [[electronic resource] ] : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 26-29, 2014. Proceedings, Part I / / edited by Ersébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXVI, 561 p. 65 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Machine theory Discrete Mathematics in Computer Science Numerical Analysis Data Science Formal Languages and Automata Theory Mathematical Applications in Computer Science |
| ISBN | 3-662-44522-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Table of Contents - Volume I.-Invited contributions -- Partial-Observation Stochastic Reachability and Parity Games -- Every graph is easy or hard: dichotomy theorems for graph problems -- Computer Poker and Computational Game Theory -- Random Deterministic Automata -- Communication Complexity Theory: Thirty-Five Years of Set Disjointness -- What does the local structure of a planar graph tell us about its global structure? -- Logic, Semantics, Automata and Theory of Programming -- Choiceless Polynomial Time on structures with small Abelian colour Classes -- Sofic-Dyck shifts -- A Logical Characterization of Timed (non-)Regular Languages -- Asymptotic Monadic Second-Order Logic -- Towards Efficient Reasoning Under Guarded-based Disjunctive Existential Rules -- Alternating Parity Krivine Automata -- Advances in Parametric Real-Time Reasoning -- Universal Lyndon Words -- Subword complexity and decomposition of the set of factors -- Cyclic Complexity of Words -- Classifying Recognizable Infinitary Trace Languages Using Word Automata -- Bounded variable logic, parameterized logarithmic space, and Savitch’s Theorem -- An algebraic characterization of unary two-way transducers -- Size-Change Abstraction and Max-Plus Automata -- Alternating Vector Addition Systems with States -- Information Rate of Some Classes of Non-regular Languages: An Automata-theoretic Approach -- Relating Nominal and Higher-Order Rewriting -- Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures -- Two Recursively Inseparable Problems for Probabilistic Automata -- Monadic Second-Order Logic with Arbitrary Monadic Predicates -- Transforming two-way alternating finite automata to one-way nondeterministic automata -- Measure Properties of Game Tree Languages -- On Upper and Lower Bounds on the Length of Alternating Towers -- LaxF: Side Conditions and External Evidence as Monads -- The monoid of queue actions -- Undecidable properties of self-affine sets and multi-tape automata -- Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality -- A Unifying Approach for Multistack Pushdown Automata -- Definability and Transformations for Cost Logics and Automatic Structures -- Generalised Lyndon-Schützenberger Equations -- Complexity of Equivalence and Learning for Multiplicity Tree Automata -- Monadic datalog and regular tree pattern queries -- Model Checking Concurrent Recursive Programs using Temporal Logics -- Decidability of the interval temporal logic AABB over the rationals -- Reachability in Pushdown Register Automata -- A Generalization of the Łos-Tarski Preservation Theorem over Classes of Finite Structures -- Determinising Parity Automata -- Tight Bounds for Complementing Parity Automata -- On Infinite Words Determined by Indexed Languages -- A Pumping Lemma for Two-Way Finite Transducers -- Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems -- The Dynamic Descriptive Complexity of k-Clique. |
| Record Nr. | UNISA-996198257403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
