top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Descriptional complexity of formal systems : 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17-19, 2019, proceedings / edited by Michal Hospodár, Galina Jirásková, Stavros Konstantinidis
Descriptional complexity of formal systems : 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17-19, 2019, proceedings / edited by Michal Hospodár, Galina Jirásková, Stavros Konstantinidis
Creatore [DCFS (Workshop) (21st : 2019 : Košice, Slovakia.)]
Estensione 1 online resource (x, 299 pages) : illustrations
Disciplina 005.1015113
Accesso persona Hospodár, Michal (Computer scientist), editor
Jirásková, Galina, editor
Konstantinidis, Stavros, editor
ISBN 9783030232474
3030232476
3030232468
9783030232467
9783030232481
3030232484
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A general framework for sequential grammars with control mechanisms / Rudolf Freund -- Low-complexity tilings of the plane / Jarkko Kari -- Union-freeness, deterministic union-freeness and union-complexity / Benedek Nagy -- Limited automata : properties, complexity and variants / Giovanni Pighizzini -- Nondeterministic right one-way jumping finite automata / Simon Beier and Markus Holzer -- State complexity of single-word pattern matching in regular languages / Janusz A. Brzozowski, Sylvie Davies, and Abhishek Madan -- Square, power, positive closure, and complementation on star-free languages / Sylvie Davies and Michal Hospodár -- Descriptional complexity of matrix simple semi-conditional grammars / Henning Fernau, Lakshmanan Kuppusamy, and Indhumathi Raman -- Regulated tree automata / Henning Fernau and Martin Vu -- Generalized de Bruijn words and the state complexity of conjugate sets / Daniel Gabric, Štěpán Holub, and Jeffrey Shallit -- The syntactic complexity of semi-flower languages / Kitti Gelle and Szabolcs Iván -- Limited nondeterminism of input-driven pushdown automata : decidability and complexity / Yo-Sub Han, Sang-Ki Ko, and Kai Salomaa -- Computability on quasi-Polish spaces / Mathieu Hoyrup, Cristóbal Rojas, Victor Selivanov, and Donald M. Stull -- NFA-to-DFA trade-off for regular operations / Galina Jirásková and Ivana Krajňáková -- State complexity of simple splicing / Lila Kari and Timothy Ng
Nondeterminism growth and state complexity / Chris Keeler and Kai Salomaa -- Descriptional complexity of iterated uniform finite-state transducers / Martin Kutrib, Andreas Malcher, Carlo Mereghetti, and Beatrice Palano -- On classes of regular languages related to monotone WQOs / Mizuhito Ogawa and Victor Selivanov -- State complexity of GF(2)-concatenation and GF(2)-inverse on unary languages / Alexander Okhotin and Elizaveta Sazhneva -- Pushdown automata and constant height : decidability and bounds / Giovanni Pighizzini and Luca Prigioniero -- On the decidability of finding a positive ILP-instance in a regular set of ILP-instances / Petra Wolf -- How does adiabatic quantum computation fit into quantum automata theory? / Tomoyuki Yamakami.
Record Nr. STANFORD-a13630105
[DCFS (Workshop) (21st : 2019 : Košice, Slovakia.)]  
Materiale a stampa
Lo trovi qui: Stanford University
Combinatorial algorithms [electronic resource] : 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings / Leszek Gasieniec, Ralf Klasing, Tomasz Radzik (eds.).
Combinatorial algorithms [electronic resource] : 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings / Leszek Gasieniec, Ralf Klasing, Tomasz Radzik (eds.).
Creatore [International Workshop on Combinatorial Algorithms (31st : 2020 : Online)]
Estensione 1 online resource (438 p.).
Disciplina 004.01/51
Accesso persona Gąsieniec, Leszek
Klasing, Ralf
Radzik, Tomasz
ISBN 9783030489663
3030489663
9783030489656
3030489655
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Optimization by Population: Large-Scale Distributed Optimization Via Population Protocols -- Coordinating Swarms of Objects at Extreme Dimensions -- Algorithms for String Processing in Restricted-Access Models of Computation -- Contents -- Invited Paper -- Coordinating Swarms of Objects at Extreme Dimensions -- 1 Introduction -- 2 Traffic -- 3 Uniform Global Control for Particle Swarms -- 4 Online Triangulation and Structured Exploration -- 5 Cohesive Control -- 6 Coordinated Motion Planning
7 Constructing and Reconfiguring Large-Scale Structures -- 8 Conclusion -- References -- Contributed Papers -- A Family of Tree-Based Generators for Bubbles in Directed Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Defining a Bubble Generator from a Spanning Tree -- 4 Experimental Results -- 4.1 An Empirical Analysis of the Characteristics of the Bubble Generator Based on the Choice of the Spanning Tree -- 4.2 Application of the Bubble Generator to the Identification of AS Events in RNA-seq Data -- 5 Conclusions and Open Problems -- References -- The Micro-world of Cographs -- 1 Introduction
2 Preliminaries -- 3 Graph Parameters -- 3.1 Co-chromatic Number -- 3.2 Lettericity -- 3.3 Boxicity -- 3.4 H-Index -- 3.5 Achromatic Number -- 4 The Hierarchy -- 5 Conclusion and Open Problems -- References -- Parameterized Complexity of (A, )-Path Packing -- 1 Introduction -- 2 Preliminaries -- 3 Standard Parameterizations of ALPP -- 3.1 Intractable Cases -- 3.2 Tractable Cases -- 4 Structural Parameterizations -- 5 Hardness on Grid Graphs -- 6 Concluding Remarks -- References -- On Proper Labellings of Graphs with Minimum Label Sum -- 1 Introduction -- 2 First Insights into the Problem
2.1 Warm-Up Results -- 2.2 Using Larger Labels can be Arbitrarily Better -- 3 Complexity Aspects -- 3.1 NP-hardness for Planar Bipartite Graphs -- 3.2 Polynomiality for Bounded-Treewidth Graphs -- 4 General Bounds -- 4.1 Upper Bounds -- 4.2 General Conjecture and Refined Bounds for Bipartite Graphs -- 5 Conclusion -- References -- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework -- 1 Introduction -- 1.1 Our Problem -- 1.2 Related Results -- 1.3 Our Results -- 2 Preliminaries -- 2.1 Optimization Variant of Dominating Set Reconfiguration -- 2.2 Useful Observations
3 Polynomial-Time (In)tractability -- 3.1 PSPACE-Completeness for Several Graph Classes -- 3.2 Linear-Time Algorithms -- 4 Fixed-Parameter (In)tractability -- 4.1 FPT Algorithm for Degeneracy and Solution Size -- 4.2 FPT Algorithm for Vertex Cover Number -- References -- On the Complexity of Stackelberg Matroid Pricing Problems -- 1 Introduction -- 2 Preliminaries -- 3 Uniform Matroid -- 4 Laminar Matroid -- 5 Partition Matroid -- 6 Conclusion and Future Work -- References -- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten -- 1 Introduction -- 2 Preliminaries
Record Nr. STANFORD-a13630366
[International Workshop on Combinatorial Algorithms (31st : 2020 : Online)]  
Materiale a stampa
Lo trovi qui: Stanford University
Combinatorial pattern matching : 25th annual symposium, CPM 2014 Moscow, Russia, June 16-18, 2014, proceedings / Alexander S. Kulikov, Sergei O. Kuznetsov, Pavel Pevzner (eds.).
Combinatorial pattern matching : 25th annual symposium, CPM 2014 Moscow, Russia, June 16-18, 2014, proceedings / Alexander S. Kulikov, Sergei O. Kuznetsov, Pavel Pevzner (eds.).
Creatore [CPM (Symposium) (25th : 2014 : Moscow, Russia)]
Estensione 1 online resource.
Disciplina 005.1
Accesso persona Kulikov, Alexander S., editor
Kuznetsov, Sergei O., editor
Pevzner, Pavel, editor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783319075662
3319075667
9783319075655
3319075659
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Trees -- Regular expressions -- Graphs -- Point sets -- Arrays.
Record Nr. NYU-004446017
[CPM (Symposium) (25th : 2014 : Moscow, Russia)]  
Materiale a stampa
Lo trovi qui: New York University
Application and theory of petri nets and concurrency : 35th International Conference, PETRI NETS 2014, Tunis, Tunisia, June 23-27, 2014 : proceedings / Gianfranco Ciardo, Ekkart Kindler (Eds.).
Application and theory of petri nets and concurrency : 35th International Conference, PETRI NETS 2014, Tunis, Tunisia, June 23-27, 2014 : proceedings / Gianfranco Ciardo, Ekkart Kindler (Eds.).
Creatore [International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency (35th : 2014 : Tunis, Tunisia)]
Estensione 1 online resource (xiv, 394 pages) : illustrations.
Disciplina 511.3/5
Accesso persona Ciardo, Gianfranco, editor
Kindler, Ekkart, editor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783319077345 (electronic bk.)
3319077341 (electronic bk.)
9783319077338
3319077333
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Propagation Nets -- Energy-Utility Analysis for Resilient Systems Using Probabilistic Model Checking -- Complex Networks and Link Streams for the Empirical Analysis of Large Software -- Soundness of Timed-Arc Workflow Nets -- Process Model Discovery: A Method Based on Transition System Decomposition -- Discovering Block-Structured Process Models from Incomplete Event Logs -- Synthesis of Persistent Systems -- Learning Transparent Data Automata -- A Programming Language for Spatial Distribution of Net Systems -- Flow Unfolding of Multi-clock Nets -- Non-interference by Unfolding -- The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems -- On Weighted Petri Net Transducers -- Exhibition of a Structural Bug with Wings -- Analysis of Petri Net Models through Stochastic Differential Equations -- Dynamic Networks of Timed Petri Nets -- A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application -- On the Reversibility of Well-Behaved Weighted Choice-Free Systems -- (Stochastic) Model Checking in GreatSPN -- StrataGEM: A Generic Petri Net Verification Framework -- A Steering Server for Collaborative Simulation of Quantitative Petri Nets -- Kaira: Development Environment for MPI Applications.
Record Nr. NYU-004446252
[International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency (35th : 2014 : Tunis, Tunisia)]  
Materiale a stampa
Lo trovi qui: New York University
Models, languages, and tools for concurrent and distributed programming : essays dedicated to Rocco De Nicola on the occasion of his 65th birthday / Michele Boreale, Flavio Corradini, Michele Loreti, Rosario Pugliese (eds.).
Models, languages, and tools for concurrent and distributed programming : essays dedicated to Rocco De Nicola on the occasion of his 65th birthday / Michele Boreale, Flavio Corradini, Michele Loreti, Rosario Pugliese (eds.).
Estensione 1 online resource (xiii, 498 pages) : illustrations (some color)
Disciplina 005.1015113
Accesso persona Boreale, Michele, editor
Corradini, Flavio, editor
Loreti, Michele, editor
Pugliese, Rosario, editor
De Nicola, Rocco, honouree
Soggetto-Autore De Nicola, Rocco
ISBN 9783030214852
3030214850
9783030214845
3030214842
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Homage from Friends -- Observational Semantics -- Coordination Models and Languages -- Logics and Types -- Distributed Systems Modelling -- Security.
Record Nr. STANFORD-a13630102
Materiale a stampa
Lo trovi qui: Stanford University
Euro-Par 2019 : Parallel Processing Workshops : Euro-Par 2019 International Workshops, Göttingen, Germany, August 26-30, 2019, Revised Selected Papers / edited by Ulrich Schwardmann, Christian Boehme, Dora B. Heras et al. (eds.).
Euro-Par 2019 : Parallel Processing Workshops : Euro-Par 2019 International Workshops, Göttingen, Germany, August 26-30, 2019, Revised Selected Papers / edited by Ulrich Schwardmann, Christian Boehme, Dora B. Heras et al. (eds.).
Creatore [International Conference on Parallel and Distributed Computing (25th : 2019 : Göttingen, Germany)]
Estensione 1 online resource (764 pages).
Disciplina 004.35
Accesso persona Schwardmann, Ulrich
Boehme, Christian
Heras, Dora B. (Dora Blanco)
ISBN 9783030483401
3030483401
9783030483418
303048341X
9783030483395
3030483398
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Auto-DASP -- Workshop on Autonomic Solutions for Parallel and Distributed Data Stream Processing -- COLOC -- Workshop on Data Locality -- F2C-DP -- Workshop on Fog-to-Cloud Distributed Processing -- FPDAPP -- International Workshop on Future Perspectives of Decentralized Applications -- HeteroPar -- Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Platforms -- HPCN -- Workshop on High Performance Computing and Networking in Aerospace -- LSDVE -- Seventh Workshop on Large Scale Distributed Virtual Environments -- ParaMo -- Workshop on Parallel Programming Models in HP Cloud -- PCDLifeS -- Workshop on Parallel and Distributed Computing for Life Sciences: Algorithms, Methodologies and Tools -- PMACS -- Workshop on Performance Monitoring and Analysis of Cluster Systems -- Resilience -- Twelfth Workshop on Resiliency in High Performance Computing in Clouds, Grids, and Clusters -- Poster Papers.
Record Nr. STANFORD-a13630350
[International Conference on Parallel and Distributed Computing (25th : 2019 : Göttingen, Germany)]  
Materiale a stampa
Lo trovi qui: Stanford University
Computational science -- ICCS 2020 : 20th International Conference, Amsterdam, The Netherlands, June 3-5, 2020, Proceedings. Part V / Valeria V. Krzhizhanovskaya, Gábor Závodszky, Michael H. Lees, Jack J. Dongarra, Peter M. A. Sloot, Sérgio Brissos, João Teixeira (eds.).
Computational science -- ICCS 2020 : 20th International Conference, Amsterdam, The Netherlands, June 3-5, 2020, Proceedings. Part V / Valeria V. Krzhizhanovskaya, Gábor Závodszky, Michael H. Lees, Jack J. Dongarra, Peter M. A. Sloot, Sérgio Brissos, João Teixeira (eds.).
Creatore [International Conference on Computational Science (20th : 2020 : Amsterdam, Netherlands)]
Estensione 1 online resource (xix, 618 pages) : illustrations (some color).
Disciplina 004.0151
Accesso persona Krzhizhanovskaya, Valeria V.
Závodszky, Gábor
Lees, Michael H.
Dongarra, J. J.
Sloot, Peter, 1956-
Brissos, Sérgio
Teixeira, João
ISBN 9783030504267
3030504263
9783030504250
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Optimization -- Swarm Intelligence Approach for Rational Global Approximation of Characteristic Curves for the Van Der Waals Equation of State rescuers -- Fuzzy Intelligence in Monitoring Older Adults with Wearables -- Deep Analytics for Management and Cybersecurity of the National Energy Grid -- Regression methods for detecting anomalies in flue gas desulphurization installations in coal-fired power plants based on sensor data -- Autonomous Guided Vehicles for Smart Industries the state of the art and research challenges -- IoT-based cow health monitoring system -- Visual Self-Healing Modelling for Reliable Internet-of-Things Systems -- Comparative Analysis of Time Series Databases in the Context of Edge Computing for Low Power Sensor Networks -- Conversational Interface for Managing Non-Trivial Internet-of-Things Systems -- Improving Coverage Area in Sensor Deployment using Genetic Algorithm -- Object-Oriented Internet Reactive Interoperability -- Impact of long-range dependent traffic in IoT local wireless networks on backhaul link performance -- Track of Computer Graphics, Image Processing and Artificial Intelligence -- OpenGraphGym: A Parallel Reinforcement Learning Framework for Graph Optimization Problems -- Weighted Clustering for Bees Detection on Video Images -- Improved Two-Step Binarization of Degraded Document Images Based on Gaussian Mixture Model -- Cast Shadow Generation using Generative Adversarial Networks -- Medical Image Enhancement using Super Resolution Methods -- Plane Space Representation in Context of Mode-based Symmetry Plane Detection -- Impression Curve as a New Tool in the study of Visual Diversity of Computer Game Levels for Individual Phases of the Design Process -- Visual analysis of computer game output video stream for gameplay metrics -- Depth map estimation with consistent normals from stereo images -- Parametric Learning of Associative Functional Networks Through a Modified Memetic Self-Adaptive Firefly Algorithm -- Dual formulation of the TV-Stokes denoising model for multidimensional vectorial images -- Minimizing material consumption of 3D printing with stress-guided.
Record Nr. STANFORD-a13653827
[International Conference on Computational Science (20th : 2020 : Amsterdam, Netherlands)]  
Materiale a stampa
Lo trovi qui: Stanford University
Computer science -- theory and applications [electronic resource] : 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29-July 3, 2020, Proceedings / Henning Fernau (ed.).
Computer science -- theory and applications [electronic resource] : 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29-July 3, 2020, Proceedings / Henning Fernau (ed.).
Creatore [International Computer Science Symposium in Russia (15th : 2020 : Yekaterinburg, Russia)]
Estensione 1 online resource (444 p.).
Disciplina 004
Accesso persona Fernau, Henning, 1965-
ISBN 9783030500269
3030500268
9783030500252
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Contents -- Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations -- 1 Introduction -- 2 Preliminaries -- 3 Quantum Fingerprinting -- 3.1 Binary Quantum Fingerprinting Function -- 3.2 q-ary Quantum Fingerprinting -- 3.3 Quantum Fingerprinting for Computations -- 4 Quantum Hashing -- 4.1 One-way -Resistance -- 4.2 Collision -Resistance -- 4.3 Balanced Quantum (, )-Resistance -- 4.4 Quantum (, )-Hash Functions Construction Via Small-Biased Sets -- 5 Quantum Hashing for Finite Abelian Groups -- 6 Pre-image Resistance of Quantum Hashing
3.1 Derived Relations -- 3.2 Network Positions -- 4 Centrality -- 4.1 Neighborhood Inclusion -- 4.2 Positional Dominance -- 4.3 Homogeneity -- 4.4 Application -- 5 Computational Challenges -- 5.1 Transformations -- 5.2 Dominance -- 5.3 Rankings -- 6 Conclusions -- References -- Second-Order Finite Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Basics -- 2.2 Ordered Decision Diagrams -- 3 Second-Order Finite Automata -- 4 Transductions -- 5 Canonization of ODDs Using Transductions -- 6 Applications -- 7 Conclusion -- References -- Isomorphic Distances Among Elections -- 1 Introduction
1.1 Distances, Election Isomorphism, and Motivation -- 1.2 Organization -- 2 Preliminaries -- 3 Distances Among Elections -- 3.1 Election Isomorphism Problem -- 3.2 Isomorphic Distances -- 3.3 Positionwise and Pairwise Distances -- 4 Research Directions -- 4.1 New Distances -- 4.2 Effective Algorithms -- 4.3 Properties of the Distances -- 4.4 Evaluating Distances in Practice -- 5 Summary -- References -- Tandem Duplications, Segmental Duplications and Deletions, and Their Applications -- 1 Introduction -- 1.1 Tandem Duplications -- 1.2 Copy Number Profiles -- 2 Preliminaries
2.1 Strings and Tandem Duplications -- 2.2 Copy Number Profiles, Segmental Duplications and Deletions -- 3 Results on Tandem Duplications -- 3.1 Exemplar-TD Is NP-hard -- 3.2 Exemplar-TD Is FPT -- 4 Results on Copy Number Profiles -- 4.1 Hardness of Approximation for MCNG -- 4.2 W[1]-Hardness for MCNG -- 4.3 The Copy Number Profile Conforming Problem -- 5 Concluding Remarks and Open Problems -- References -- Faster 2-Disjoint-Shortest-Paths Algorithm -- 1 Introduction -- 2 Definitions and the DP Formululation -- 3 Reducing the Running Time to O(V7) -- 4 Reducing Running Time to O(V6)
Record Nr. STANFORD-a13653891
[International Computer Science Symposium in Russia (15th : 2020 : Yekaterinburg, Russia)]  
Materiale a stampa
Lo trovi qui: Stanford University
Advances in computer systems architecture : 12th Asia-Pacific Conference, ACSAC 2007, Seoul, Korea, August 23-25, 2007 : proceedings / Lynn Choi, Yunheung Paek, Sangyeun Cho (eds.).
Advances in computer systems architecture : 12th Asia-Pacific Conference, ACSAC 2007, Seoul, Korea, August 23-25, 2007 : proceedings / Lynn Choi, Yunheung Paek, Sangyeun Cho (eds.).
Creatore [ACSAC (Asia-Pacific Computer Systems Architecture Conference) (12th : 2007 : Seoul, Korea)]
Estensione 1 online resource (xiii, 400 pages) : illustrations.
Disciplina 004.2/2
Accesso persona Choi, Lynn
Paek, Yunheung
Cho, Sangyeun
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783540743095
354074309X
3540743081
9783540743088
Classificazione TP303-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-004340931
[ACSAC (Asia-Pacific Computer Systems Architecture Conference) (12th : 2007 : Seoul, Korea)]  
Materiale a stampa
Lo trovi qui: New York University
Types for proofs and programs : international workshop, TYPES 2006, Nottingham, UK, April 18-21, 2006 : revised selected papers / Thorsten Altenkirch, Conor McBride (eds.).
Types for proofs and programs : international workshop, TYPES 2006, Nottingham, UK, April 18-21, 2006 : revised selected papers / Thorsten Altenkirch, Conor McBride (eds.).
Creatore [TYPES 2006 (2006 : Nottingham, England)]
Estensione 1 online resource (viii, 268 pages) : illustrations.
Disciplina 511.3
Accesso persona Altenkirch, Thorsten, 1962-
McBride, Conor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783540744641
3540744649
9783540744634
3540744630
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-004340939
[TYPES 2006 (2006 : Nottingham, England)]  
Materiale a stampa
Lo trovi qui: New York University