000 08394nam a22006615i 4500
001 978-3-540-69507-3
003 DE-He213
005 20240730192241.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540695073
_9978-3-540-69507-3
024 7 _a10.1007/978-3-540-69507-3
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aSOFSEM 2007: Theory and Practice of Computer Science
_h[electronic resource] :
_b33nd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings /
_cedited by Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, František Plášil.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXXI, 937 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4362
505 0 _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 forStable 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 MethodologyConstruction 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.
650 0 _aComputer science.
_99832
650 0 _aSoftware engineering.
_94138
650 0 _aComputer networks .
_931572
650 0 _aDatabase management.
_93157
650 0 _aInformation storage and retrieval systems.
_922213
650 0 _aApplication software.
_9149206
650 1 4 _aTheory of Computation.
_9149207
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aComputer Communication Networks.
_9149208
650 2 4 _aDatabase Management.
_93157
650 2 4 _aInformation Storage and Retrieval.
_923927
650 2 4 _aComputer and Information Systems Applications.
_9149209
700 1 _avan Leeuwen, Jan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9149210
700 1 _aItaliano, Giuseppe F.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9149211
700 1 _avan der Hoek, Wiebe.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9149212
700 1 _aMeinel, Christoph.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9149213
700 1 _aSack, Harald.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9149214
700 1 _aPlášil, František.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9149215
710 2 _aSpringerLink (Online service)
_9149216
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540695066
776 0 8 _iPrinted edition:
_z9783540834663
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4362
_9149217
856 4 0 _uhttps://doi.org/10.1007/978-3-540-69507-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94153
_d94153