SOFSEM 2016: Theory and Practice of Computer Science: 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016, Proceedings: Lecture Notes in Computer Science, cartea 9587
Editat de Rūsiņš Mārtiņš Freivalds, Gregor Engels, Barbara Cataniaen Limba Engleză Paperback – 3 feb 2016
The 43 fullpapers presented in this volume were carefully reviewed and selected from 116submissions. They are organized in topical sections named: foundations ofcomputer science; software engineering: methods, tools, applications; and data,information, and knowledge engineering. The volume also contains 7 invitedtalks in full paper length.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 342.70 lei
Preț vechi: 428.37 lei
-20% Nou
Puncte Express: 514
Preț estimativ în valută:
65.59€ • 68.13$ • 54.48£
65.59€ • 68.13$ • 54.48£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783662491911
ISBN-10: 3662491915
Pagini: 630
Ilustrații: XV, 630 p. 150 illus. in color.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.89 kg
Ediția:1st ed. 2016
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: 3662491915
Pagini: 630
Ilustrații: XV, 630 p. 150 illus. in color.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.89 kg
Ediția:1st ed. 2016
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
Foundations of Computer Science.- Cryptographyin a Quantum World.- Relating Sublinear Space Computability among GraphConnectivity and Related Problems.- Learning Automatic Families of Languages.- SoftwareEngineering: Methods, Tools, Applications From ESSENCE to Theory OrientedSoftware Engineering.- Incremental Queries and Transformations: From Concepts toIndustrial Applications.- Data, Information, and Knowledge Engineering BigSequence Management: A Glimpse on the Past, the Present, and the Future.- Pay-as-you-goData Integration: Experiences and Recurring Themes.- Foundations of ComputerScience.- Robust Recoverable Path Using Backup Nodes.- On Contact Graphs withCubes and Proportional Boxes.- Orthogonal Layout with Optimal Face Complexity.-L-Drawings of Directed Graphs.- A Combinatorial Model of Two-sided Search.- Onthe Power of Laconic Advice in Communication Complexity.- Using AttributeGrammars to Model Nested Workflows with Extra Constraints.- A Natural Countingof Lambda Terms.- Online Minimum Spanning Tree with Advice.- Subsequence Automatawith Default Transitions.- Run-Time Checking Multi-threaded Java Programs.- OnlineGraph Coloring with Advice and Randomized Adversary.- Pseudoknot-GeneratingOperation.- Capabilities of Ultrametric Automata with One, Two, and ThreeStates.- The Complexity of Paging Against a Probabilistic Adversary.- On ParityGame Preorders and the Logic of Matching Plays.- A PTAS for SchedulingUnrelated Machines of Few Different Types.- Compacting a Dynamic Edit DistanceTable by RLE Compression.- Walking Automata in Free Inverse Monoids.- PrecedenceScheduling with Unit Execution Time is Equivalent to Parametrized Biclique.- Grover'sSearch with Faults on Some Marked Elements.- Reachability problems for PAMs.- Onthe Effects of Nondeterminism on Ordered Restarting Automata.- Quantum Walks onTwo-Dimensional Grids with Multiple Marked Locations.- How to Smooth Entropy?.-Bounded TSO-to-SC Linearizability is Decidable.- Probabilistic Autoreductions.-Software Engineering: Methods, Tools, Applications ABS: A High-Level Modeling Language forCloud-Aware Programming.- Aspect, Rich, and Anemic Domain Models in Enterprise InformationSystems.- Finding Optimal Compatible Set of Software Components Using Integer LinearProgramming.- Effective Parallel Multicore-optimized K-mers CountingAlgorithm.- Meta-Evolution Style for Software Architecture Evolution.- TheSimulation Relation for Formal e-contracts.- Data, Information, and KnowledgeEngineering Solving the Problem of Selecting Suitable Objective Measures by ClusteringAssociation Rules through the Measures Themselves.- Survey On Concern Separationin Service Integration.- Utilizing Vector Models for Automatic TextLemmatization.- Improving Keyword Extraction from Movie Subtitles by Utilizing Temporal Properties.- Identification ofNavigation Lead Candidates Using Citation and Co-Citation Analysis.- SummarizingOnline User Reviews Using Bicliques.-Post-Processing Association Rules: aNetwork Based Label Propagation Approach.- Application of Multiple SoundRepresentations in Multipitch Estimation Using Shift-Invariant ProbabilisticLatent Component Analysis.- Projection for Nested Word Automata Speeds up XPathEvaluation on XML Streams.- Evaluation of Static/Dynamic Cache for SimilaritySearch Engines.
Caracteristici
Includes supplementary material: sn.pub/extras