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ț: 1018.35 lei
- 20% Preț: 322.44 lei
- 20% Preț: 324.00 lei
- 20% Preț: 315.78 lei
- 20% Preț: 238.01 lei
- 20% Preț: 554.98 lei
- 20% Preț: 322.44 lei
- 20% Preț: 438.69 lei
- 20% Preț: 1005.39 lei
- 20% Preț: 325.58 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 970.25 lei
- 20% Preț: 1339.86 lei
- 20% Preț: 782.28 lei
- 17% Preț: 360.19 lei
- 20% Preț: 620.45 lei
- 20% Preț: 307.71 lei
- 20% Preț: 550.29 lei
- 20% Preț: 560.32 lei
- 20% Preț: 319.32 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 256.27 lei
- 20% Preț: 172.69 lei
- 20% Preț: 548.74 lei
- 20% Preț: 315.19 lei
- 20% Preț: 611.22 lei
- 20% Preț: 315.78 lei
- 20% Preț: 552.64 lei
- 20% Preț: 722.90 lei
- 20% Preț: 722.90 lei
- 20% Preț: 301.95 lei
- 20% Preț: 504.57 lei
- 20% Preț: 1120.51 lei
- 20% Preț: 369.12 lei
- 20% Preț: 334.94 lei
- 20% Preț: 552.64 lei
- Preț: 389.31 lei
- 20% Preț: 564.99 lei
- 20% Preț: 724.49 lei
- 20% Preț: 552.64 lei
- 15% Preț: 549.86 lei
- 20% Preț: 331.82 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 330.71 lei
Preț vechi: 413.39 lei
-20% Nou
Puncte Express: 496
Preț estimativ în valută:
63.31€ • 68.60$ • 52.87£
63.31€ • 68.60$ • 52.87£
Carte tipărită la comandă
Livrare economică 12-26 decembrie
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.