000 06198nam a22005775i 4500
001 978-3-642-11266-9
003 DE-He213
005 20170628035156.0
007 cr nn 008mamaa
008 100301s2010 gw | s |||| 0|eng d
020 _a9783642112669
_9978-3-642-11266-9
024 7 _a10.1007/978-3-642-11266-9
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aUL
_2bicssc
072 7 _aCOM051230
_2bisacsh
082 0 4 _a005.1
_223
100 1 _aLeeuwen, Jan.
_eeditor.
245 1 0 _aSOFSEM 2010: Theory and Practice of Computer Science
_h[electronic resource] :
_b36th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 23-29, 2010. Proceedings /
_cedited by Jan Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorný, Bernhard Rumpe.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXV, 780 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5901
505 0 _aInvited Talks -- Forcing Monotonicity in Parameterized Verification: From Multisets to Words -- Research Issues in the Automated Testing of Ajax Applications -- Essential Performance Drivers in Native XML DBMSs -- Continuous Processing of Preference Queries in Data Streams -- Clock Synchronization: Open Problems in Theory and Practice -- Regret Minimization and Job Scheduling -- Lessons in Software Evolution Learned by Listening to Smalltalk -- The Web of Things: Extending the Web into the Real World -- Web Science: The Digital-Heritage Case -- Model-Driven Software Product Line Testing: An Integrated Approach -- Taming the Complexity of Inductive Logic Programming -- Regular Papers -- A Rule Format for Unit Elements -- Approximability of Edge Matching Puzzles -- A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks -- R-Programs: A Framework for Distributing XML Structural Joins across Function Calls -- Fast Arc-Annotated Subsequence Matching in Linear Space -- Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs -- A Kernel for Convex Recoloring of Weighted Forests -- Symbolic OBDD-Based Reachability Analysis Needs Exponential Space -- A Social Vision of Knowledge Representation and Reasoning -- Flavors of KWQL, a Keyword Query Language for a Semantic Wiki -- On Pattern Density and Sliding Block Code Behavior for the Besicovitch and Weyl Pseudo-distances -- On a Labeled Vehicle Routing Problem -- Improved Matrix Interpretation -- Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays -- Query Optimization through Cached Queries for Object-Oriented Query Language SBQL -- Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time -- Destructive Rule-Based Properties and First-Order Logic -- Learning User Preferences for 2CP-Regression for a Recommender System -- Parallel Randomized Load Balancing: A Lower Bound for a More General Model -- Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem -- Linear Complementarity Algorithms for Infinite Games -- Mixing Coverability and Reachability to Analyze VASS with One Zero-Test -- Practically Applicable Formal Methods -- Fast and Compact Prefix Codes -- New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes -- Smooth Optimal Decision Strategies for Static Team Optimization Problems and Their Approximations -- Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph -- On the Complexity of the Highway Pricing Problem -- Accelerating Smart Play-Out -- Optimum Broadcasting in Complete Weighted-Vertex Graphs -- On Contracting Graphs to Fixed Pattern Graphs -- Dynamic Edit Distance Table under a General Weighted Cost Function -- How to Complete an Interactive Configuration Process? -- Design Patterns Instantiation Based on Semantics and Model Transformations -- A Complete Symbolic Bisimulation for Full Applied Pi Calculus -- OTwig: An Optimised Twig Pattern Matching Approach for XML Databases -- Picture Recognizability with Automata Based on Wang Tiles -- Unilateral Orientation of Mixed Graphs -- Maintaining XML Data Integrity in Programs -- Improving Classification Performance with Focus on the Complex Areas -- CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions -- Source Code Rejuvenation Is Not Refactoring -- Empirical Evaluation of Strategies to Detect Logical Change Dependencies -- Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup -- An Amortized Search Tree Analysis for k-Leaf Spanning Tree -- Approximate Structural Consistency -- Comprehensive System for Systematic Case-Driven Software Reuse -- Comparison of Scoring and Order Approach in Description Logic -- Homophily of Neighborhood in Graph Relational Classifier -- Multilanguage Debugger Architecture -- Student Groups Modeling by Integrating Cluster Representation and Association Rules Mining -- Finding and Certifying Loops -- Vertex Ranking with Capacity.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aData structures (Computer science).
650 0 _aDatabase management.
650 1 4 _aComputer Science.
650 2 4 _aSoftware Engineering/Programming and Operating Systems.
650 2 4 _aData Storage Representation.
650 2 4 _aData Structures.
650 2 4 _aDatabase Management.
650 2 4 _aSoftware Engineering.
650 2 4 _aProgramming Techniques.
700 1 _aMuscholl, Anca.
_eeditor.
700 1 _aPeleg, David.
_eeditor.
700 1 _aPokorný, Jaroslav.
_eeditor.
700 1 _aRumpe, Bernhard.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642112652
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5901
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-11266-9
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c23333
_d23333