SOFSEM 2010: Theory and Practice of Computer Science 36th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 23-29, 2010. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Leeuwen, Jan van (Επιμελητής έκδοσης), Muscholl, Anca (Επιμελητής έκδοσης), Peleg, David (Επιμελητής έκδοσης), Pokorný, Jaroslav (Επιμελητής έκδοσης), Rumpe, Bernhard (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Σειρά:Lecture Notes in Computer Science, 5901
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 06263nam a22005895i 4500
001 978-3-642-11266-9
003 DE-He213
005 20151204180517.0
007 cr nn 008mamaa
008 100301s2010 gw | s |||| 0|eng d
020 |a 9783642112669  |9 978-3-642-11266-9 
024 7 |a 10.1007/978-3-642-11266-9  |2 doi 
040 |d GrThAP 
050 4 |a QA76.758 
072 7 |a UMZ  |2 bicssc 
072 7 |a UL  |2 bicssc 
072 7 |a COM051230  |2 bisacsh 
082 0 4 |a 005.1  |2 23 
245 1 0 |a SOFSEM 2010: Theory and Practice of Computer Science  |h [electronic resource] :  |b 36th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 23-29, 2010. Proceedings /  |c edited by Jan van Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorný, Bernhard Rumpe. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 |a XV, 780 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5901 
505 0 |a Invited 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 |a Computer science. 
650 0 |a Software engineering. 
650 0 |a Computer programming. 
650 0 |a Data structures (Computer science). 
650 0 |a Database management. 
650 1 4 |a Computer Science. 
650 2 4 |a Software Engineering/Programming and Operating Systems. 
650 2 4 |a Programming Techniques. 
650 2 4 |a Data Storage Representation. 
650 2 4 |a Data Structures. 
650 2 4 |a Database Management. 
650 2 4 |a Software Engineering. 
700 1 |a Leeuwen, Jan van.  |e editor. 
700 1 |a Muscholl, Anca.  |e editor. 
700 1 |a Peleg, David.  |e editor. 
700 1 |a Pokorný, Jaroslav.  |e editor. 
700 1 |a Rumpe, Bernhard.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642112652 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5901 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-11266-9  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)