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: Lecture Notes in Computer Science, cartea 8939
Editat de Giuseppe Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorný, Jean-Jacques Quisquater, Roger Wattenhoferen Limba Engleză Paperback – 2 ian 2015
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 579.30 lei
- Preț: 410.88 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- 15% Preț: 448.04 lei
- 20% Preț: 353.50 lei
- Preț: 389.49 lei
- 20% Preț: 309.90 lei
- 20% Preț: 645.28 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 20% Preț: 310.28 lei
- 20% Preț: 655.02 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- Preț: 449.57 lei
- 20% Preț: 591.51 lei
- 18% Preț: 938.83 lei
- 20% Preț: 337.00 lei
- 20% Preț: 649.50 lei
- 20% Preț: 607.40 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 583.40 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.49 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 17% Preț: 360.20 lei
- 20% Preț: 763.23 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.58 lei
- 20% Preț: 369.13 lei
- 20% Preț: 580.93 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 583.40 lei
- 20% Preț: 583.40 lei
- 15% Preț: 438.59 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.30 lei
Preț: 349.04 lei
Preț vechi: 436.30 lei
-20% Nou
Puncte Express: 524
Preț estimativ în valută:
66.80€ • 69.48$ • 55.14£
66.80€ • 69.48$ • 55.14£
Carte tipărită la comandă
Livrare economică 14-28 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783662460771
ISBN-10: 3662460777
Pagini: 632
Ilustrații: XVI, 616 p. 116 illus.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.88 kg
Ediția:2015
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3662460777
Pagini: 632
Ilustrații: XVI, 616 p. 116 illus.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.88 kg
Ediția:2015
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.- LowerBounds for Linear Decision Trees with Bounded Weights.- Software & Web Engineering.- A Model-Driven Approach to Generate External DSLs fromObject-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 CachingStrategies.- 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 MiningAlgorithms.- 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.