SOFSEM 2007: Theory and Practice of Computer Science 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Leeuwen, Jan van (Επιμελητής έκδοσης), Italiano, Giuseppe F. (Επιμελητής έκδοσης), Hoek, Wiebe van der (Επιμελητής έκδοσης), Meinel, Christoph (Επιμελητής έκδοσης), Sack, Harald (Επιμελητής έκδοσης), Plášil, František (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
• Σειρά: Lecture Notes in Computer Science, 4362
• Θέματα: Computer science.; Computer communication systems.; Software engineering.; Computers.; Database management.; Information storage and retrieval.; Computer Science.; Theory of Computation.; Software Engineering.; Computer Communication Networks.; Database Management.; Information Storage and Retrieval.; Information Systems Applications (incl. Internet).

 Invited Talks -- Graphs from Search Engine Queries -- Model-Checking Large Finite-State Systems and Beyond -- Interaction and Realizability -- A Short Introduction to Computational Social Choice -- Distributed Models and Algorithms for Mobile Robot Systems -- Point-to-Point Shortest Path Algorithms with Preprocessing -- Games, Time, and Probability: Graph Models for System Design and Analysis -- Agreement Technologies -- Automatic Testing of Object-Oriented Software -- Architecture-Based Reasoning About Performability in Component-Based Systems -- Multimedia Retrieval Algorithmics -- Foundations of Computer Science -- Size of Quantum Finite State Transducers -- Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles -- Straightening Drawings of Clustered Hierarchical Graphs -- Improved Upper Bounds for ?-Backbone Colorings Along Matchings and Stars -- About the Termination Detection in the Asynchronous Message Passing Model -- Fast Approximate Point Set Matching for Information Retrieval -- A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks -- Compressed Prefix Sums -- On Optimal Solutions for the Bottleneck Tower of Hanoi Problem -- Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs -- Exact Max 2-Sat: Easier and Faster -- Maximum Finding in the Symmetric Radio Networks with Collision Detection -- An Approach to Modelling and Verification of Component Based Systems -- Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages -- On the (High) Undecidability of Distributed Synthesis Problems -- Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks -- Online Service Management Algorithm for Cellular/WALN Multimedia Networks -- A Simple Algorithm for Stable Minimum Storage Merging -- Generating High Dimensional Data and Query Sets -- Partial vs. Complete Domination: t-Dominating Set -- Estimates of Data Complexity in Neural-Network Learning -- Concurrent and Located Synchronizations in ?-Calculus -- Efficient Group Key Agreement for Dynamic TETRA Networks -- Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks -- The P k Partition Problem and Related Problems in Bipartite Graphs -- Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces -- A Model of an Amorphous Computer and Its Communication Protocol -- A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems -- Indexing Factors with Gaps -- Information Efficiency -- Deterministic Simulation of a NFA with k–Symbol Lookahead -- Mobility Management Using Virtual Domain in IPv6-Based Cellular Networks -- Restarting Tree Automata -- A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3 -- Formal Translation Directed by Parallel LLP Parsing -- Self-adaptive Lagrange Relaxation Algorithm for Aggregated Multicast -- A Language for Reliable Service Composition -- Operational Semantics of Framed Temporal Logic Programs -- Constraints for Argument Filterings -- Multi-agent Systems -- Performance Analysis of a Multiagent Architecture for Passenger Transportation -- Teacher-Directed Learning with Mixture of Experts for View-Independent Face Recognition -- FTTH-Enhanced Mini-System m TBCP-Based Overlay Construction and Evaluation -- On Efficient Resource Allocation in Communication Networks -- Protecting Agent from Attack in Grid ComputingIII -- Incremental Learning of Planning Operators in Stochastic Domains -- Competitive Contract Net Protocol -- Agent Oriented Methodology Construction and Customization with HDA -- Emerging Web Technologies -- Building an Ontological Base for Experimental Evaluation of Semantic Web Applications -- Semantic Web Approach in Designing a Collaborative E-Item Bank System -- A Hybrid Region Weighting Approach for Relevance Feedback in Region-Based Image Search on the Web -- Rapid Development of Web Interfaces to Heterogeneous Systems -- Enhancing Security by Embedding Biometric Data in IP Header -- Runtime-Efficient Approach for Multiple Continuous Filtering in XML Message Brokers -- A Semantic Peer-to-Peer Overlay for Web Services Discovery -- Multi-document Summarization Based on Cluster Using Non-negative Matrix Factorization -- A Program Slicing Based Method to Filter XML/DTD Documents -- A Hybrid Approach for XML Similarity -- Personalized Presentation in Web-Based Information Systems -- Immune-Inspired Online Method for Service Interactions Detection -- Dependable Software and Systems -- Separation of Concerns and Consistent Integration in Requirements Modelling -- Checking Interaction Consistency in MARMOT Component Refinements -- Towards a Versatile Contract Model to Organize Behavioral Specifications -- Improved Processing of Textual Use Cases: Deriving Behavior Specifications -- A Dialogue-Based NLIDB System in a Schedule Management Domain -- Experimental Assessment of the Practicality of a Fault-Tolerant System -- A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems -- Extracting Zing Models from C Source Code -- Parameterised Extra-Functional Prediction of Component-Based Control Systems – Industrial Experience -- Explicit Connectors in Component Based Software Engineering for Distributed Embedded Systems.