Computer Science - Theory and Applications [[electronic resource] ] : 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings / / edited by Edward Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay Vereshchagin |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XX, 389 p. 39 illus.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Numerical analysis Machine theory Discrete Mathematics in Computer Science Theory of Computation Numerical Analysis Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory |
ISBN | 3-319-06686-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Finding All Solutions of Equations in Free Groups and Monoids with Involution -- Algorithmic Meta Theorems for Sparse Graph Classes -- The Lattice of Definability -- Counting Popular Matchings in House Allocation Problems -- Vertex Disjoint Paths in Upward Planar Graphs -- On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains -- Testing low degree trigonometric polynomials -- Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees -- A Fast Branching Algorithm for Cluster Vertex Deletion -- Separation Logic with One Quantified Variable -- Notions of metric dimension of corona products -- On the Complexity of Computing Two Nonlinearity Measures -- Model Checking for String Problems -- Semiautomatic Structures -- The Query Complexity of Witness Finding -- Primal implication as encryption -- Processing Succinct Matrices and Vectors -- Constraint Satisfaction with Counting Quantifiers -- Dynamic Complexity of Planar 3-connected Graph Isomorphism -- Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions -- First-Order Logic on CPDA Graphs -- Recognizing two-sided contexts in cubic time -- A Parameterized Algorithm for Packing Overlapping Subgraphs -- Crossing-free spanning trees in visibility graphs of points between monotone polygonal obstacles -- The Connectivity of Boolean Satisfiability -- Randomized communication complexity of approximating Kolmogorov complexity -- Space Saving by Dynamic Algebraization. |
Record Nr. | UNISA-996200001803316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Computer Science - Theory and Applications : 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings / / edited by Edward Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay Vereshchagin |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XX, 389 p. 39 illus.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Numerical analysis Machine theory Discrete Mathematics in Computer Science Theory of Computation Numerical Analysis Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory |
ISBN | 3-319-06686-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Finding All Solutions of Equations in Free Groups and Monoids with Involution -- Algorithmic Meta Theorems for Sparse Graph Classes -- The Lattice of Definability -- Counting Popular Matchings in House Allocation Problems -- Vertex Disjoint Paths in Upward Planar Graphs -- On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains -- Testing low degree trigonometric polynomials -- Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees -- A Fast Branching Algorithm for Cluster Vertex Deletion -- Separation Logic with One Quantified Variable -- Notions of metric dimension of corona products -- On the Complexity of Computing Two Nonlinearity Measures -- Model Checking for String Problems -- Semiautomatic Structures -- The Query Complexity of Witness Finding -- Primal implication as encryption -- Processing Succinct Matrices and Vectors -- Constraint Satisfaction with Counting Quantifiers -- Dynamic Complexity of Planar 3-connected Graph Isomorphism -- Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions -- First-Order Logic on CPDA Graphs -- Recognizing two-sided contexts in cubic time -- A Parameterized Algorithm for Packing Overlapping Subgraphs -- Crossing-free spanning trees in visibility graphs of points between monotone polygonal obstacles -- The Connectivity of Boolean Satisfiability -- Randomized communication complexity of approximating Kolmogorov complexity -- Space Saving by Dynamic Algebraization. |
Record Nr. | UNINA-9910484553203321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Computer Science -- Theory and Applications [[electronic resource] ] : 7th International Computer Science Symposium in Russia, CSR 2012, Niszhny Novgorod, Russia, July 3-7, 2012, Proceedings / / edited by Edward Hirsch, Juhani Karhumäki, Arto Lepistö, Michail Prilutskii |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (XXIII, 327 p. 25 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science Machine theory Computer science—Mathematics Discrete mathematics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Discrete Mathematics in Computer Science Theory of Computation Mathematics of Computing |
ISBN | 3-642-30642-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465274703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Computer Science -- Theory and Applications [[electronic resource] ] : First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings / / edited by Dima Grigoriev, John Harrison, Edward A. Hirsch |
Edizione | [1st ed. 2006.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
Descrizione fisica | 1 online resource (XVI, 684 p.) |
Disciplina | 004 |
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-34168-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Non-black-box Techniques in Cryptography -- Complexity of Polynomial Multiplication over Finite Fields -- Synchronous Elastic Circuits -- Theory Track -- SZK Proofs for Black-Box Group Problems -- Canonical Decomposition of a Regular Factorial Language -- Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure -- Inductive Type Schemas as Functors -- Unfolding Synthesis of Asynchronous Automata -- Conjugacy and Equivalence of Weighted Automata and Functional Transducers -- Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees -- Tuples of Disjoint NP-Sets -- Constructive Equivalence Relations on Computable Probability Measures -- Planar Dimer Tilings -- The Complexity of Equality Constraint Languages -- Window Subsequence Problems for Compressed Texts -- Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties -- Relativisation Provides Natural Separations for Resolution-Based Proof Systems -- Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems -- Isolation and Reducibility Properties and the Collapse Result -- Incremental Branching Programs -- Logic of Proofs for Bounded Arithmetic -- On a Maximal NFA Without Mergible States -- Expressiveness of Metric Modalities for Continuous Time -- Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction -- Weighted Logics for Traces -- On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone -- Unwinding a Non-effective Cut Elimination Proof -- Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover -- Shannon Entropy vs. Kolmogorov Complexity -- Language Equations with Symmetric Difference -- On Primitive Recursive Realizabilities -- Evidence Reconstruction of Epistemic Modal Logic S5 -- Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms -- On the Frequency of Letters in Morphic Sequences -- Functional Equations in Shostak Theories -- All Semi-local Longest Common Subsequences in Subquadratic Time -- Non-approximability of the Randomness Deficiency Function -- Multi-agent Explicit Knowledge -- Applications and Technology Track -- Polarized Subtyping for Sized Types -- Neural-Network Based Physical Fields Modeling Techniques -- Approximate Methods for Constrained Total Variation Minimization -- Dynamic Isoline Extraction for Visualization of Streaming Data -- Improved Technique of IP Address Fragmentation Strategies for DoS Attack Traceback -- Performance Comparison Between Backpropagation, Neuro-Fuzzy Network, and SVM -- Evolutionary Multi-objective Optimisation by Diversity Control -- 3D Facial Recognition Using Eigenface and Cascade Fuzzy Neural Networks: Normalized Facial Image Approach -- A New Scaling Kernel-Based Fuzzy System with Low Computational Complexity -- Bulk Synchronous Parallel ML: Semantics and Implementation of the Parallel Juxtaposition -- A Shortest Path Algorithm Based on Limited Search Heuristics -- A New Hybrid Directory Scheme for Shared Memory Multi-processors -- Manipulator Path Planning in 3-Dimensional Space -- Least Likely to Use: A New Page Replacement Strategy for Improving Database Management System Response Time -- Nonlinear Visualization of Incomplete Data Sets -- A Review of Race Detection Mechanisms -- Fuzzy-Q Knowledge Sharing Techniques with Expertness Measures: Comparison and Analysis -- Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics -- Analytic Modeling of Channel Traffic in n-Cubes -- Capturing an Intruder in the Pyramid -- Speech Enhancement in Short-Wave Channel Based on Empirical Mode Decomposition -- Extended Resolution Proofs for Conjoining BDDs -- Optimal Difference Systems of Sets with Multipliers -- Authentication Mechanism Using One-Time Password for 802.11 Wireless LAN -- Optimizing Personalized Retrieval System Based on Web Ranking -- Instruction Selection for ARM/Thumb Processors Based on a Multi-objective Ant Algorithm -- A New Flow Control Algorithm for High Speed Computer Network -- Nonlinear Systems Modeling and Control Using Support Vector Machine Technique -- Fast Motif Search in Protein Sequence Databases. |
Record Nr. | UNISA-996465876703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Computer science--theory and applications : First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006 : proceedings / / Dima Grigoriev, John Harrison, Edward A. Hirsch (eds.) |
Edizione | [1st ed. 2006.] |
Pubbl/distr/stampa | Berlin, : Springer-Verlag, c2006 |
Descrizione fisica | 1 online resource (XVI, 684 p.) |
Disciplina | 004 |
Altri autori (Persone) |
GrigorievDima
HarrisonJ <1966-> (John) HirschEdward A |
Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
Soggetto topico | Computer science |
ISBN | 3-540-34168-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Non-black-box Techniques in Cryptography -- Complexity of Polynomial Multiplication over Finite Fields -- Synchronous Elastic Circuits -- Theory Track -- SZK Proofs for Black-Box Group Problems -- Canonical Decomposition of a Regular Factorial Language -- Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure -- Inductive Type Schemas as Functors -- Unfolding Synthesis of Asynchronous Automata -- Conjugacy and Equivalence of Weighted Automata and Functional Transducers -- Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees -- Tuples of Disjoint NP-Sets -- Constructive Equivalence Relations on Computable Probability Measures -- Planar Dimer Tilings -- The Complexity of Equality Constraint Languages -- Window Subsequence Problems for Compressed Texts -- Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties -- Relativisation Provides Natural Separations for Resolution-Based Proof Systems -- Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems -- Isolation and Reducibility Properties and the Collapse Result -- Incremental Branching Programs -- Logic of Proofs for Bounded Arithmetic -- On a Maximal NFA Without Mergible States -- Expressiveness of Metric Modalities for Continuous Time -- Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction -- Weighted Logics for Traces -- On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone -- Unwinding a Non-effective Cut Elimination Proof -- Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover -- Shannon Entropy vs. Kolmogorov Complexity -- Language Equations with Symmetric Difference -- On Primitive Recursive Realizabilities -- Evidence Reconstruction of Epistemic Modal Logic S5 -- Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms -- On the Frequency of Letters in Morphic Sequences -- Functional Equations in Shostak Theories -- All Semi-local Longest Common Subsequences in Subquadratic Time -- Non-approximability of the Randomness Deficiency Function -- Multi-agent Explicit Knowledge -- Applications and Technology Track -- Polarized Subtyping for Sized Types -- Neural-Network Based Physical Fields Modeling Techniques -- Approximate Methods for Constrained Total Variation Minimization -- Dynamic Isoline Extraction for Visualization of Streaming Data -- Improved Technique of IP Address Fragmentation Strategies for DoS Attack Traceback -- Performance Comparison Between Backpropagation, Neuro-Fuzzy Network, and SVM -- Evolutionary Multi-objective Optimisation by Diversity Control -- 3D Facial Recognition Using Eigenface and Cascade Fuzzy Neural Networks: Normalized Facial Image Approach -- A New Scaling Kernel-Based Fuzzy System with Low Computational Complexity -- Bulk Synchronous Parallel ML: Semantics and Implementation of the Parallel Juxtaposition -- A Shortest Path Algorithm Based on Limited Search Heuristics -- A New Hybrid Directory Scheme for Shared Memory Multi-processors -- Manipulator Path Planning in 3-Dimensional Space -- Least Likely to Use: A New Page Replacement Strategy for Improving Database Management System Response Time -- Nonlinear Visualization of Incomplete Data Sets -- A Review of Race Detection Mechanisms -- Fuzzy-Q Knowledge Sharing Techniques with Expertness Measures: Comparison and Analysis -- Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics -- Analytic Modeling of Channel Traffic in n-Cubes -- Capturing an Intruder in the Pyramid -- Speech Enhancement in Short-Wave Channel Based on Empirical Mode Decomposition -- Extended Resolution Proofs for Conjoining BDDs -- Optimal Difference Systems of Sets with Multipliers -- Authentication Mechanism Using One-Time Password for 802.11 Wireless LAN -- Optimizing Personalized Retrieval System Based on Web Ranking -- Instruction Selection for ARM/Thumb Processors Based on a Multi-objective Ant Algorithm -- A New Flow Control Algorithm for High Speed Computer Network -- Nonlinear Systems Modeling and Control Using Support Vector Machine Technique -- Fast Motif Search in Protein Sequence Databases. |
Altri titoli varianti | CSR 2006 |
Record Nr. | UNINA-9910483392603321 |
Berlin, : Springer-Verlag, c2006 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|