LEADER 08423nam 22008415 450 001 996465336903316 005 20230406070926.0 010 $a1-280-95555-4 010 $a9786610955558 010 $a3-540-69507-9 024 7 $a10.1007/978-3-540-69507-3 035 $a(CKB)1000000000490975 035 $a(EBL)3037322 035 $a(SSID)ssj0000309840 035 $a(PQKBManifestationID)11247693 035 $a(PQKBTitleCode)TC0000309840 035 $a(PQKBWorkID)10286626 035 $a(PQKB)10818743 035 $a(DE-He213)978-3-540-69507-3 035 $a(MiAaPQ)EBC3037322 035 $a(MiAaPQ)EBC6706828 035 $a(Au-PeEL)EBL6706828 035 $a(PPN)12372659X 035 $a(EXLCZ)991000000000490975 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aSOFSEM 2007: Theory and Practice of Computer Science$b[electronic resource] $e33nd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings /$fedited by Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, Franti?ek Plá?il 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (955 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4362 300 $aDescription based upon print version of record. 311 $a3-540-69506-0 320 $aIncludes bibliographical references and index. 327 $aInvited 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4362 606 $aComputer science 606 $aSoftware engineering 606 $aComputer networks 606 $aDatabase management 606 $aInformation storage and retrieval systems 606 $aApplication software 606 $aTheory of Computation 606 $aSoftware Engineering 606 $aComputer Communication Networks 606 $aDatabase Management 606 $aInformation Storage and Retrieval 606 $aComputer and Information Systems Applications 615 0$aComputer science. 615 0$aSoftware engineering. 615 0$aComputer networks. 615 0$aDatabase management. 615 0$aInformation storage and retrieval systems. 615 0$aApplication software. 615 14$aTheory of Computation. 615 24$aSoftware Engineering. 615 24$aComputer Communication Networks. 615 24$aDatabase Management. 615 24$aInformation Storage and Retrieval. 615 24$aComputer and Information Systems Applications. 676 $a004 702 $aLeeuwen$b J. van$g(Jan), 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465336903316 996 $aSOFSEM 2007: Theory and Practice of Computer Science$9772010 997 $aUNISA