SOFSEM 2010: Theory and Practice... | Buy

This book constitutes the refereed proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2010, held in Å pindleruv Mlýn, Czech Republic, in January 2009.The 53 revised full papers, presented together with 11 invited contributions, were carefully reviewed and selected from 134 submissions. SOFSEM 2010 was organized around the following four tracks: Foundations of computer science, principles of software construction, Data, knowledge, and intelligent systems and Web science.

Invited Talks
Forcing Monotonicity in Parameterized Verification: From Multisets to Words	p. 1
Research Issues in the Automated Testing of Ajax Applications	p. 16
Essential Performance Drivers in Native XML DBMSs	p. 29
Continuous Processing of Preference Queries in Data Streams	p. 47
Clock Synchronization: Open Problems in Theory and Practice	p. 61
Regret Minimization and Job Scheduling	p. 71
Lessons in Software Evolution Learned by Listening to Smalltalk	p. 77
The Web of Things: Extending the Web into the Real World	p. 96
Web Science: The Digital-Heritage Case	p. 108
Model-Driven Software Product Line Testing: An Integrated Approach	p. 112
Taming the Complexity of Inductive Logic Programming	p. 132
Regular Papers
A Rule Format for Unit Elements	p. 141
Approximability of Edge Matching Puzzles	p. 153
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks	p. 165
R-Programs: A Framework for Distributing XML Structural Joins across Function Calls	p. 176
Fast Arc-Annotated Subsequence Matching in Linear Space	p. 188
Automated, Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs	p. 200
A Kernel for Convex Recoloring of Weighted Forests	p. 212
Symbolic OBDD-Based Reachability Analysis Needs Exponential Space	p. 224
A Social Vision of Knowledge Representation and Reasoning	p. 235
Flavors of KWQL, a Keyword Query Language for a Semantic Wiki	p. 247
On Pattern Density and Sliding Block Code Behavior for the Besicovitch and Weyl Pseudo-distances	p. 259
On a Labeled Vehicle Routing Problem	p. 271
Improved Matrix Interpretation	p. 283
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays	p. 296
Query Optimization through Cached Queries for Object-Oriented Query Language SBQL	p. 308
Perfect Matching for Biconnected Cubic Graphs in 0(n log² n) Time	p. 321
Destructive Rule-Based Properties and First-Order Logic	p. 334
Learning User Preferences for 2CP-Regression for a Recommender System	p. 346
Parallel Randomized Load Balancing: A Lower Bound for a More General Model	p. 358
Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem	p. 370
Linear Complementarity Algorithms for Infinite Games	p. 382
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test	p. 394
Practically Applicable Formal Methods	p. 407
Fast and Compact Prefix Codes	p. 419
New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes	p. 428
Smooth Optimal Decision Strategies for Static Team Optimization Problems and Their Approximations	p. 440
Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph	p. 452
On the Complexity of the Highway Pricing Problem	p. 465
Accelerating Smart Play-Out	p. 477
Optimum Broadcasting in Complete Weighted-Vertex Graphs	p. 489
On Contracting Graphs to Fixed Pattern Graphs	p. 503
Dynamic Edit Distance Table under a General Weighted Cost Function	p. 515
How to Complete an Interactive Configuration Process? Configuring as Shopping	p. 528
Design Patterns Instantiation Based on Semantics and Model Transformations	p. 540
A Complete Symbolic Bisimulation for Full Applied Pi Calculus	p. 552
OTwig: An Optimised Twig Pattern Matching Approach for XML Databases	p. 564
Picture Recognizability with Automata Based on Wang Tiles	p. 576
Unilateral Orientation of Mixed Graphs	p. 588
Maintaining XML Data Integrity in Programs: An Abstract Datatype Approach	p. 600
Improving Classification Performance with Focus on the Complex Areas	p. 612
CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions	p. 627
Source Code Rejuvenation Is Not Refactoring	p. 639
Empirical Evaluation of Strategies to Detect Logical Change Dependencies	p. 651
Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup	p. 663
An Amortized Search Tree Analysis for k-Leaf Spanning Tree	p. 672
Approximate Structural Consistency	p. 685
Comprehensive System for Systematic Case-Driven Software Reuse	p. 697
Comparison of Scoring and Order Approach in Description Logic EL(D)	p. 709
Homophily of Neighborhood in Graph Relational Classifier	p. 721
Multilanguage Debugger Architecture	p. 731
Student Groups Modeling by Integrating Cluster Representation and Association Rules Mining	p. 743
Finding and Certifying Loops	p. 755
Vertex Ranking with Capacity	p. 767
Author Index	p. 779
Table of Contents provided by Ingram. All Rights Reserved.

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.