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.
Algorithms for Sensor and Ad Hoc Networks [[electronic resource] ] : Advanced Lectures / / edited by Dorothea Wagner, Roger Wattenhofer
| Algorithms for Sensor and Ad Hoc Networks [[electronic resource] ] : Advanced Lectures / / edited by Dorothea Wagner, Roger Wattenhofer |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XIII, 418 p.) |
| Disciplina | 681.2 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Software engineering Algorithms Information storage and retrieval systems Application software Telecommunication Computer Communication Networks Software Engineering Information Storage and Retrieval Computer and Information Systems Applications Communications Engineering, Networks |
| ISBN | 3-540-74991-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Applications of Sensor Networks -- Modeling Sensor and Ad Hoc Networks -- Clustering -- MAC Layer and Coloring -- Topology Control -- Interference and Signal-to-Noise-Ratio -- Lower Bounds -- Facility Location -- Geographic Routing -- Compact Routing -- Pseudo Geometric Routing for Sensor Networks -- Minimal Range Assignments for Broadcasts -- Data Gathering in Sensor Networks -- Location Services -- Positioning -- Security -- Trust Mechanisms and Reputation Systems -- Selfish Agents and Economic Aspects -- Time Synchronization. |
| Record Nr. | UNISA-996466338203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms for Sensor and Ad Hoc Networks : Advanced Lectures / / edited by Dorothea Wagner, Roger Wattenhofer
| Algorithms for Sensor and Ad Hoc Networks : Advanced Lectures / / edited by Dorothea Wagner, Roger Wattenhofer |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XIII, 418 p.) |
| Disciplina | 681.2 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Software engineering Algorithms Information storage and retrieval systems Application software Telecommunication Computer Communication Networks Software Engineering Information Storage and Retrieval Computer and Information Systems Applications Communications Engineering, Networks |
| ISBN | 3-540-74991-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Applications of Sensor Networks -- Modeling Sensor and Ad Hoc Networks -- Clustering -- MAC Layer and Coloring -- Topology Control -- Interference and Signal-to-Noise-Ratio -- Lower Bounds -- Facility Location -- Geographic Routing -- Compact Routing -- Pseudo Geometric Routing for Sensor Networks -- Minimal Range Assignments for Broadcasts -- Data Gathering in Sensor Networks -- Location Services -- Positioning -- Security -- Trust Mechanisms and Reputation Systems -- Selfish Agents and Economic Aspects -- Time Synchronization. |
| Record Nr. | UNINA-9910484150003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms for Sensor Systems [[electronic resource] ] : 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, Patras, Greece, September 17-18, 2015, Revised Selected Papers / / edited by Prosenjit Bose, Leszek Antoni Gąsieniec, Kay Römer, Roger Wattenhofer
| Algorithms for Sensor Systems [[electronic resource] ] : 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, Patras, Greece, September 17-18, 2015, Revised Selected Papers / / edited by Prosenjit Bose, Leszek Antoni Gąsieniec, Kay Römer, Roger Wattenhofer |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XIV, 225 p. 19 illus. in color.) |
| Disciplina | 681.2 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Algorithms
Computers Computer communication systems Computer science—Mathematics Artificial intelligence Application software Algorithm Analysis and Problem Complexity Computation by Abstract Devices Computer Communication Networks Mathematics of Computing Artificial Intelligence Information Systems Applications (incl. Internet) |
| ISBN | 3-319-28472-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Plane and Planarity Thresholds for Random Geometric Graphs -- Connectivity of a dense mesh of randomly oriented directional antennas under a realistic fading model -- Maintaining Intruder Detection Capability in a Rectangular Domain with Sensors -- The Weakest Oracle for Symmetric Consensus in Population Protocols -- Exact and Approximation Algorithms for Data Mule Scheduling in a Sensor Network -- Limitations of Current Wireless Scheduling Algorithms -- Deterministic rendezvous with detection using beeps -- Minimizing total sensor movement for barrier coverage by non-uniform sensors on a line -- A comprehensive and lightweight security architecture to secure the IoT throughout the lifecycle of a device based on HIMMO -- Maximizing Throughput in Energy-Harvesting Sensor Nodes -- On verifying and maintaining connectivity of interval temporal networks -- Beachcombing on Strips and Islands -- Radio Aggregation Scheduling -- Gathering of Robots on Meeting-Points -- Mutual Visibility with an Optimal Number of Colors -- Mobile Agents Rendezvous in spite of a Malicious Agent. . |
| Record Nr. | UNISA-996466361403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms for Sensor Systems : 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, Patras, Greece, September 17-18, 2015, Revised Selected Papers / / edited by Prosenjit Bose, Leszek Antoni Gąsieniec, Kay Römer, Roger Wattenhofer
| Algorithms for Sensor Systems : 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, Patras, Greece, September 17-18, 2015, Revised Selected Papers / / edited by Prosenjit Bose, Leszek Antoni Gąsieniec, Kay Römer, Roger Wattenhofer |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XIV, 225 p. 19 illus. in color.) |
| Disciplina | 681.2 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Algorithms
Computers Computer communication systems Computer science—Mathematics Artificial intelligence Application software Algorithm Analysis and Problem Complexity Computation by Abstract Devices Computer Communication Networks Mathematics of Computing Artificial Intelligence Information Systems Applications (incl. Internet) |
| ISBN | 3-319-28472-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Plane and Planarity Thresholds for Random Geometric Graphs -- Connectivity of a dense mesh of randomly oriented directional antennas under a realistic fading model -- Maintaining Intruder Detection Capability in a Rectangular Domain with Sensors -- The Weakest Oracle for Symmetric Consensus in Population Protocols -- Exact and Approximation Algorithms for Data Mule Scheduling in a Sensor Network -- Limitations of Current Wireless Scheduling Algorithms -- Deterministic rendezvous with detection using beeps -- Minimizing total sensor movement for barrier coverage by non-uniform sensors on a line -- A comprehensive and lightweight security architecture to secure the IoT throughout the lifecycle of a device based on HIMMO -- Maximizing Throughput in Energy-Harvesting Sensor Nodes -- On verifying and maintaining connectivity of interval temporal networks -- Beachcombing on Strips and Islands -- Radio Aggregation Scheduling -- Gathering of Robots on Meeting-Points -- Mutual Visibility with an Optimal Number of Colors -- Mobile Agents Rendezvous in spite of a Malicious Agent. . |
| Record Nr. | UNINA-9910484507903321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata, Languages, and Programming [[electronic resource] ] : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II / / edited by Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, Roger Wattenhofer
| Automata, Languages, and Programming [[electronic resource] ] : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II / / edited by Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, Roger Wattenhofer |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (700 p. 51 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Computer networks Information storage and retrieval systems Application software Computer science—Mathematics Discrete mathematics Theory of Computation Computer Communication Networks Information Storage and Retrieval Computer and Information Systems Applications Discrete Mathematics in Computer Science |
| ISBN | 3-642-31585-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465569603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages, and Programming [[electronic resource] ] : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I / / edited by Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, Roger Wattenhofer
| Automata, Languages, and Programming [[electronic resource] ] : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I / / edited by Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, Roger Wattenhofer |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (860 p. 64 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Computer networks Information storage and retrieval systems Application software Computer science—Mathematics Discrete mathematics Theory of Computation Computer Communication Networks Information Storage and Retrieval Computer and Information Systems Applications Discrete Mathematics in Computer Science |
| ISBN | 3-642-31594-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465566203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Computing and Networking [[electronic resource] ] : 10th International Conference, ICDCN 2009, Hyderabad, India, January 3-6, 2009, Proceedings / / edited by Vijay Garg, Roger Wattenhofer, Kishore Kothapalli
| Distributed Computing and Networking [[electronic resource] ] : 10th International Conference, ICDCN 2009, Hyderabad, India, January 3-6, 2009, Proceedings / / edited by Vijay Garg, Roger Wattenhofer, Kishore Kothapalli |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XVIII, 476 p.) |
| Disciplina | 004/.36 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Computer programming Software engineering Data protection Algorithms Application software Computer Communication Networks Programming Techniques Software Engineering Data and Information Security Computer and Information Systems Applications |
| ISBN | 3-540-92295-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A.K. Choudhury Memorial Lecture -- Tracking Dynamics Using Sensor Networks: Some Recurring Themes -- Keynote Talks -- Distributed Computing and the Multicore Revolution -- The Rise of People-Centric Sensing -- Temporal Considerations in Wireless Networks and Cyberphysical Systems -- Sensor Networks 1 -- Finding Facilities Fast -- Large-Scale Networked Systems: From Anarchy to Geometric Self-structuring -- Cheapest Paths in Multi-interface Networks -- Concept-Based Routing in Ad-Hoc Networks -- Heuristics for Minimizing Interference in Sensor Networks -- Multi-core and Shared Memory -- Non-blocking Array-Based Algorithms for Stacks and Queues -- Provable STM Properties: Leveraging Clock and Locks to Favor Commit and Early Abort -- Aspectising Concurrency for the RTSJ -- An Asymptotic Performance/Energy Analysis and Optimization of Multi-core Architectures -- A Cost-Optimal Algorithm for Guard Zone Problem -- Peer-to-Peer Computing -- Underlay Aware Resiliency in P2P Overlays -- HPC5: An Efficient Topology Generation Mechanism for Gnutella Networks -- Representation of Complex Concepts for Semantic Routed Network -- Guaranteeing Eventual Coherency across Data Copies, in a Highly Available Peer-to-Peer Distributed File System -- Reliability and Security -- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks -- Response-Time Modeling of Controller Area Network (CAN) -- A Threat-Aware Anomaly-Based Intrusion-Detection Approach for Obtaining Network-Specific Useful Alarms -- Traffic Engineering Based Attack Detection in Active Networks -- Security against Sybil Attack in Wireless Sensor Network through Location Verification -- Distributed Computing -- Incentives to Tight the Runtime Estimates of EASY Backfilling -- An Index-Based Mobile Checkpointing and Recovery Algorithm -- A Formal Framework and a Tool for the Specification and Analysis of G-Nets Models Based on Graph Transformation -- Fair Resource Allocation in Distributed Combinatorial Auctioning Systems -- Network Algorithms -- Compact Routing Schemes for Dynamic Trees in the Fixed Port Model -- An Analytical Model of Information Dissemination for a Gossip-Based Protocol -- A Distributed O(|E|) Algorithm for Optimal Link-Reversal -- Fault Tolerance and Models -- Two Consensus Algorithms with Atomic Registers and Failure Detector ? -- Self-similar Functions and Population Protocols: A Characterization and a Comparison -- Byzantine-Resilient Convergence in Oblivious Robot Networks -- Snap-Stabilization in Message-Passing Systems -- A Novel Performance Index for Characterizing Stochastic Faulty Patterns in Mesh-Based Networks -- Sensor Networks 2 -- Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks -- QDMAC: An Energy Efficient Low Latency MAC Protocol for Query Based Wireless Sensor Networks -- Field Sensing and Target Tracking Using Mobile Sensors -- Q-Coverage Problem in Wireless Sensor Networks -- On Providing Reliability and Maximizing Network Lifetime in Multi-Sink Wireless Sensor Networks -- Fault-Tolerance and Replication -- Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks -- A General Approach to Analyzing Quorum-Based Heterogeneous Dynamic Data Replication Schemes -- Tree-Based Dynamic Primary Copy Algorithms for Replicated Databases -- FTRepMI: Fault-Tolerant, Sequentially-Consistent Object Replication for Grid Applications -- Wireless Networks -- Effective Layer-3 Protocols for Integrating Mobile Ad Hoc Network and the Internet -- Performance Analysis of a UMTS Cell with Underlying Tunnel-WLANs -- Performance Comparison of Orthogonal Gold and Walsh Hadamard Codes for Quasi-Synchronous CDMA Communication -- Analysis of Optimum Interleaver for Receivers in IDMA Systems -- Enhancement of QoS in 802.11e for Different Traffics -- Sensor Networks 3 -- Flooding-Assisted Threshold Assignment for Aggregate Monitoring in Sensor Networks -- A Mechanism to Structure Mission-Aware Interaction in Mobile Sensor Networks -- Balancing Energy Dissipation in Data Gathering Wireless Sensor Networks Using Ant Colony Optimization -- Rate Adaptive Channel MAC -- Grid and Cluster Computing -- Efficient Load Balancing on a Cluster for Large Scale Online Video Surveillance -- Cluster Performance Forecasting Using Predictive Modeling for Virtual Beowulf Clusters -- A Hierarchical Approach to Handle Group Mutual Exclusion Problem in Distributed Systems -- Virtual Time Fair Queuing Algorithm for a Computational Grid. |
| Record Nr. | UNISA-996466005903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Principles of Distributed Systems [[electronic resource] ] : 9th International Conference, OPODIS 2005, Pisa, Italy, December 12-14, 2005, Revised Selected Paper / / edited by James H. Anderson, Giuseppe Prencipe, Roger Wattenhofer
| Principles of Distributed Systems [[electronic resource] ] : 9th International Conference, OPODIS 2005, Pisa, Italy, December 12-14, 2005, Revised Selected Paper / / edited by James H. Anderson, Giuseppe Prencipe, Roger Wattenhofer |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIV, 448 p.) |
| Disciplina | 005.4/476 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer systems
Computer networks Software engineering Computer programming Operating systems (Computers) Computers, Special purpose Computer System Implementation Computer Communication Networks Software Engineering Programming Techniques Operating Systems Special Purpose and Application-Based Systems |
| ISBN | 3-540-36322-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk 1 -- Distributed Algorithms for Systems of Autonomous Mobile Robots -- Invited Talk 2 -- Real-Time Issues in Mobile Wireless Networks -- Session 1: Nonblocking Synchronization -- A Lazy Concurrent List-Based Set Algorithm -- Efficiently Implementing a Large Number of LL/SC Objects -- Can Memory Be Used Adaptively by Uniform Algorithms? -- Randomized Wait-Free Consensus Using an Atomicity Assumption -- Session 2: Fault-Tolerant Broadcast and Consensus -- Optimal Randomized Fair Exchange with Secret Shared Coins -- Two Abstractions for Implementing Atomic Objects in Dynamic Systems -- Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast -- Session 3: Self-stabilizing Systems -- Self-stabilizing Population Protocols -- A Self-stabilizing Link-Coloring Protocol Resilient to Unbounded Byzantine Faults in Arbitrary Networks -- Timed Virtual Stationary Automata for Mobile Networks -- Asynchronous and Fully Self-stabilizing Time-Adaptive Majority Consensus -- Session 4: Peer-to-Peer Systems and Collaborative Environments -- Stable Predicate Detection in Dynamic Systems -- MTcast: Robust and Efficient P2P-Based Video Delivery for Heterogeneous Users -- Towards a Theory of Self-organization -- Node Discovery in Networks -- Session 5: Sensor Networks and Mobile Computing -- Optimal Clock Synchronization Under Energy Constraints in Wireless Ad-Hoc Networks -- Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph -- A State-Based Model of Sensor Protocols -- Session 6: Security and Verification -- Approximation Bounds for Black Hole Search Problems -- Revising UNITY Programs: Possibilities and Limitations -- Session 7: Real-Time Systems -- The Partitioned, Static-Priority Scheduling of Sporadic Real-Time Tasks with Constrained Deadlines on Multiprocessor Platforms -- New Schedulability Tests for Real-Time Task Sets Scheduled by Deadline Monotonic on Multiprocessors -- Static-Priority Scheduling of Sporadic Messages on a Wireless Channel -- Implementing Reliable Distributed Real-Time Systems with the ?-Model -- Session 8: Peer-to-Peer Systems -- Reconfigurable Distributed Storage for Dynamic Networks -- Skip B-Trees -- Bounding Communication Cost in Dynamic Load Balancing of Distributed Hash Tables -- Session 9: Sensor Networks and Mobile Computing -- On the Power of Anonymous One-Way Communication -- Quality-Aware Resource Management for Wireless Sensor Networks -- Topology Control with Limited Geometric Information. |
| Record Nr. | UNISA-996466011403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
SOFSEM 2015: Theory and Practice of Computer Science [[electronic resource] ] : 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015, Proceedings / / edited by Giuseppe Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorný, Jean-Jacques Quisquater, Roger Wattenhofer
| SOFSEM 2015: Theory and Practice of Computer Science [[electronic resource] ] : 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015, Proceedings / / edited by Giuseppe Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorný, Jean-Jacques Quisquater, Roger Wattenhofer |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVI, 616 p. 116 illus.) : online resource |
| Disciplina | 004.015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Information storage and retrieval systems Software engineering Artificial intelligence Cryptography Data encryption (Computer science) Discrete Mathematics in Computer Science Information Storage and Retrieval Software Engineering Artificial Intelligence Cryptology |
| ISBN | 3-662-46078-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNISA-996198829903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
SOFSEM 2015: Theory and Practice of Computer Science : 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015, Proceedings / / edited by Giuseppe Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorný, Jean-Jacques Quisquater, Roger Wattenhofer
| SOFSEM 2015: Theory and Practice of Computer Science : 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015, Proceedings / / edited by Giuseppe Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorný, Jean-Jacques Quisquater, Roger Wattenhofer |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVI, 616 p. 116 illus.) : online resource |
| Disciplina | 004.015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Information storage and retrieval systems Software engineering Artificial intelligence Cryptography Data encryption (Computer science) Discrete Mathematics in Computer Science Information Storage and Retrieval Software Engineering Artificial Intelligence Cryptology |
| ISBN | 3-662-46078-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910483550203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||