LEADER 05227nam 2200577 a 450 001 9910767508403321 005 20200520144314.0 010 $a3-540-32217-5 024 7 $a10.1007/11611257 035 $a(CKB)1000000000213584 035 $a(SSID)ssj0000320079 035 $a(PQKBManifestationID)11253469 035 $a(PQKBTitleCode)TC0000320079 035 $a(PQKBWorkID)10343634 035 $a(PQKB)11590597 035 $a(DE-He213)978-3-540-32217-7 035 $a(MiAaPQ)EBC3067613 035 $a(PPN)123130484 035 $a(EXLCZ)991000000000213584 100 $a20051207d2006 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aSOFSEM 2006 $etheory and practice of computer science : 32nd conference on current trends in theory and practice of computer science, Merin, Czech Republic, January 21-27, 2006 : proceedings /$fJiri Wiedermann ... [et al.] (eds.) 205 $a1st ed. 2006. 210 $aBerlin ;$aNew York $cSpringer$dc2006 215 $a1 online resource (XVI, 580 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v3831 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-31198-X 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- How Can Nature Help Us Compute? -- Evolving Ontology Evolution -- A Formal Comparison of Visual Web Wrapper Generators -- Beyond the Horizon: Planning Future European ICT R&D -- Selfish Routing in Networks -- New Physics and Hypercomputation -- Models and Algorithms for Wireless Sensor Networks (Smart Dust) -- SomeWhere in the Semantic Web -- Mobility in Wireless Networks -- Group Communication: From Practice to Theory -- Regular Papers -- A General Data Reduction Scheme for Domination in Graphs -- Incremental Method for XML View Maintenance in Case of Non Monitored Data Sources -- Non-intersecting Complexity -- Constructing Interference-Minimal Networks -- Matching Points with Rectangles and Squares -- Searching Paths of Constant Bandwidth -- Graph Searching and Search Time -- Reasoning About Inconsistent Concurrent Systems: A Non-classical Temporal Logic -- Simple Algorithm for Sorting the Fibonacci String Rotations -- Oriented Coloring: Complexity and Approximation -- nonblocker: Parameterized Algorithmics for minimum dominating set -- Quantum Finite Automata and Logics -- FDSI-Tree: A Fully Distributed Spatial Index Tree for Efficient & Power-Aware Range Queries in Sensor Networks -- Roman Domination: A Parameterized Perspective -- Sedna: A Native XML DBMS -- Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring -- The Knowledge Cartography ? A New Approach to Reasoning over Description Logics Ontologies -- Complexity and Exact Algorithms for Multicut -- Using Extensible Heterogeneous Database Transformers -- P-Selectivity, Immunity, and the Power of One Bit -- Transparent Migration of Database Services -- Merging and Merge-Sort in a Single Hop Radio Network -- On Optimal and Efficient in Place Merging -- A Personalized Recommendation System Based on PRML for E-Commerce -- An Efficient Index Scheme for XML Databases -- On Separating Constant from Polynomial Ambiguity of Finite Automata -- Reliable Broadcasting Without Collision Detection -- Semi-strong Static Type Checking of Object-Oriented Query Languages -- Building a Fuzzy Transformation System -- News Generating Via Fuzzy Summarization of Databases -- Improving Web Sites with Web Usage Mining, Web Content Mining, and Semantic Analysis -- Automatic Distribution of Sequential Code Using JavaSymphony Middleware -- Unifying Framework for Message Passing -- Heuristics on the Definition of UML Refinement Patterns -- The Complexity of Problems on Implicitly Represented Inputs -- How Many Dots Are Really Needed for Head-Driven Chart Parsing? -- Ontology Acquisition for Automatic Building of Scientific Portals -- Improved ROCK for Text Clustering Using Asymmetric Proximity -- Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet -- Computational Complexity of Relay Placement in Sensor Networks -- On the NP-Completeness of Some Graph Cluster Measures -- A Flexible Policy Architecture for Mobile Agents -- An Improved Digital Signature with Message Recovery Using Self-certified Public Keys Without Trustworthy System Authority -- Small Independent Edge Dominating Sets in Graphs of Maximum Degree Three -- The Best Student Paper -- Level-of-Detail in Behaviour of Virtual Humans. 410 0$aLecture notes in computer science ;$v3831. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 606 $aComputer software$vCongresses 606 $aComputers$vCongresses 615 0$aComputer software 615 0$aComputers 676 $a005.1 701 $aWiedermann$b J$g(Juraj)$013345 712 12$aSOFSEM 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910767508403321 996 $aSOFSEM 2006$94198946 997 $aUNINA