Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    UID:
    gbv_816979219
    Umfang: Online-Ressource (XV, 616 S.)
    Ausgabe: Online-Ausg. Berlin [u.a.] Springer 2015
    ISBN: 9783662460788
    Serie: Lecture notes in computer science 8939
    Inhalt: Keynote Talk -- What is Computation: An Epistemic Approach -- Foundations of Computer Science -- Progress (and Lack Thereof) for Graph Coloring Approximation Problems -- Recent Results in Scalable Multi-Party Computation -- Online Bipartite Matching in Offline Time (Abstract) -- Software & Web Engineering -- Quo Vadis Explicit-State Model Checking -- The Dos and Dont’s of Crowdsourcing Software Development -- Data, Information and Knowledge Engineering -- Adaptively Approximate Techniques in Distributed Architectures -- Back to the Future – Should SQL Surrender to SPARQL? -- Foundations of Computer Science -- Balancing Energy Consumption for the Establishment of Multi-interface Networks -- The Maximum k-Differential Coloring Problem -- Exact Algorithms for 2-clustering with Size Constraints in the Euclidean Plane -- Local Routing in Convex Subdivisions -- Nondeterministic Modal Interfaces -- Group Search on the Line -- Online Makespan Scheduling with Sublinear Advice -- Deterministic Rendezvous in Restricted Graphs -- Fastest, Average and Quantile Schedule -- Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP -- Maximally Permissive Controlled System Synthesis for Modal Logic -- Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem -- Finding Highly Connected Subgraphs -- Fixing Improper Colorings of Graphs -- Efficient Online Strategies for Renting Servers in the Cloud -- Palk is Linear Recognizable Online -- Two Grammatical Equivalents of Flip-Pushdown Automata -- On the Hierarchy Classes of Finite Ultrametric Automata -- Nash-Williams-type and Chvat´al-type Conditions in One-Conflict Graphs. -Optimal State Reductions of Automata with Partially Specified Behaviors. -Quantum Pushdown Automata with a Garbage Tape -- Towards a Characterization of Leaf Powers by Clique Arrangements -- Filling Logarithmic Gaps in Distributed Complexity for Global Problems -- On Visibly Pushdown Trace Languages -- Dominating an s-t-Cut in a Network -- Lower Bounds for Linear Decision Trees with Bounded Weights -- Software & Web Engineering -- A Model-Driven Approach to Generate External DSLs from Object-Oriented APIs -- Function Based Requirements Engineering and Design – Towards Efficient and Transparent Plant Engineering -- Software Developer Activity as a Source for Identifying Hidden Source Code Dependencies -- Discovering Motifs in Real-World Social Networks -- Data, Information, and Knowledge Engineering -- Exploiting Semantic Activity Labels to Facilitate Consistent Specialization of Abstract Process Activities -- Efficient Similarity Search by Combining Indexing and Caching Strategies -- Retrieving Documents Related to Database Queries -- Advantages of Dependency Parsing for Free Word Order Natural Languages -- Detecting Identical Entities in the Semantic Web Data -- Conducting a Web Browsing Behaviour Study – An Educational Scenario -- A Uniform Programmning Language for Implementing XML Standards -- OntoSDM: An Approach to Improve Quality on Spatial Data Mining Algorithms -- Cryptography, Security, and Verification -- Attribute-Based Encryption Optimized for Cloud Computing -- Trustworthy Virtualization of the ARMv7 Memory Subsystem -- True Random Number Generators Secure in a Changing Environment: Improved Security Bounds -- Java Loops Are Mainly Polynomial.
    Inhalt: This book constitutes the proceedings of the 41st International Conference on Current Trends in Theory and Practice of Computer Science held in Pec pod Sněžkou, Czech Republic, during January 24-29, 2015. The book features 8 invited talks and 42 regular papers which were carefully reviewed and selected from 101 submissions. The papers are organized in topical sections named: foundations of computer science; software and Web engineering; data, information, and knowledge engineering; and cryptography, security, and verification.
    Anmerkung: Literaturangaben
    Weitere Ausg.: ISBN 3662460777
    Weitere Ausg.: ISBN 9783662460771
    Weitere Ausg.: Druckausg. Theory and practice of computer science Heidelberg : Springer, 2015 ISBN 9783662460771
    Weitere Ausg.: ISBN 3662460777
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Theoretische Informatik ; Software Engineering ; World Wide Web ; Data Mining ; Wissenstechnik ; Kryptologie ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    UID:
    kobvindex_ZLB15888993
    Umfang: XV, 616 Seiten , graph. Darst. , 24 cm
    ISBN: 9783662460771 , 3662460777
    Serie: Lecture notes in computer science 8939
    Anmerkung: Literaturangaben
    Sprache: Englisch
    Schlagwort(e): Theoretische Informatik ; Kongress ; Pec pod Sněžkou 〈2015〉 ; Kongress ; Konferenzschrift
    Mehr zum Autor: Italiano, Giuseppe F.
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    UID:
    almahu_BV042380361
    Umfang: XV, 616 S. : , Ill., graph. Darst.
    ISBN: 978-3-662-46077-1
    Serie: Lecture notes in computer science 8939
    Weitere Ausg.: Erscheint auch als Online-Ausgabe ISBN 978-3-662-46078-8
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Theoretische Informatik ; Software Engineering ; World Wide Web ; Data Mining ; Wissenstechnik ; Kryptologie ; Künstliche Intelligenz ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    UID:
    almahu_9947364437302882
    Umfang: XVI, 616 p. 116 illus. , online resource.
    ISBN: 9783662460788
    Serie: Lecture Notes in Computer Science, 8939
    Inhalt: This book constitutes the proceedings of the 41st International Conference on Current Trends in Theory and Practice of Computer Science held in Pec pod Sněžkou, Czech Republic, during January 24-29, 2015. The book features 8 invited talks and 42 regular papers which were carefully reviewed and selected from 101 submissions. The papers are organized in topical sections named: foundations of computer science; software and Web engineering; data, information, and knowledge engineering; and cryptography, security, and verification.
    Anmerkung: Keynote Talk -- What is Computation: An Epistemic Approach -- Foundations of Computer Science -- Progress (and Lack Thereof) for Graph Coloring Approximation Problems -- Recent Results in Scalable Multi-Party Computation -- Online Bipartite Matching in Offline Time (Abstract) -- Software & Web Engineering -- Quo Vadis Explicit-State Model Checking -- The Dos and Dont’s of Crowdsourcing Software Development -- Data, Information and Knowledge Engineering -- Adaptively Approximate Techniques in Distributed Architectures -- Back to the Future – Should SQL Surrender to SPARQL? -- Foundations of Computer Science -- Balancing Energy Consumption for the Establishment of Multi-interface Networks -- The Maximum k-Differential Coloring Problem -- Exact Algorithms for 2-clustering with Size Constraints in the Euclidean Plane -- Local Routing in Convex Subdivisions -- Nondeterministic Modal Interfaces -- Group Search on the Line -- Online Makespan Scheduling with Sublinear Advice -- Deterministic Rendezvous in Restricted Graphs -- Fastest, Average and Quantile Schedule -- Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP -- Maximally Permissive Controlled System Synthesis for Modal Logic -- Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem -- Finding Highly Connected Subgraphs -- Fixing Improper Colorings of Graphs -- Efficient Online Strategies for Renting Servers in the Cloud -- Palk is Linear Recognizable Online -- Two Grammatical Equivalents of Flip-Pushdown Automata -- On the Hierarchy Classes of Finite Ultrametric Automata -- Nash-Williams-type and Chvat´al-type Conditions in One-Conflict Graphs. -Optimal State Reductions of Automata with Partially Specified Behaviors. -Quantum Pushdown Automata with a Garbage Tape -- Towards a Characterization of Leaf Powers by Clique Arrangements -- Filling Logarithmic Gaps in Distributed Complexity for Global Problems -- On Visibly Pushdown Trace Languages -- Dominating an s-t-Cut in a Network -- Lower Bounds for Linear Decision Trees with Bounded Weights -- Software & Web Engineering -- A Model-Driven Approach to Generate External DSLs from Object-Oriented APIs -- Function Based Requirements Engineering and Design – Towards Efficient and Transparent Plant Engineering -- Software Developer Activity as a Source for Identifying Hidden Source Code Dependencies -- Discovering Motifs in Real-World Social Networks -- Data, Information, and Knowledge Engineering -- Exploiting Semantic Activity Labels to Facilitate Consistent Specialization of Abstract Process Activities -- Efficient Similarity Search by Combining Indexing and Caching Strategies -- Retrieving Documents Related to Database Queries -- Advantages of Dependency Parsing for Free Word Order Natural Languages -- Detecting Identical Entities in the Semantic Web Data -- Conducting a Web Browsing Behaviour Study – An Educational Scenario -- A Uniform Programmning Language for Implementing XML Standards -- OntoSDM: An Approach to Improve Quality on Spatial Data Mining Algorithms -- Cryptography, Security, and Verification -- Attribute-Based Encryption Optimized for Cloud Computing -- Trustworthy Virtualization of the ARMv7 Memory Subsystem -- True Random Number Generators Secure in a Changing Environment: Improved Security Bounds -- Java Loops Are Mainly Polynomial.
    In: Springer eBooks
    Weitere Ausg.: Printed edition: ISBN 9783662460771
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Meinten Sie 3662454777?
Meinten Sie 3662461757?
Meinten Sie 3662440776?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz