000 | 06114nam a22006495i 4500 | ||
---|---|---|---|
001 | 978-3-540-32217-7 | ||
003 | DE-He213 | ||
005 | 20240730203449.0 | ||
007 | cr nn 008mamaa | ||
008 | 100410s2006 gw | s |||| 0|eng d | ||
020 |
_a9783540322177 _9978-3-540-32217-7 |
||
024 | 7 |
_a10.1007/11611257 _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 2006: Theory and Practice of Computer Science _h[electronic resource] : _b32nd Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, January 21-27, 2006, Proceedings / _cedited by Jirí Wiedermann, Gerard Tel, Jaroslav Pokorný, Mária Bieliková, Július Štuller. |
250 | _a1st ed. 2006. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2006. |
|
300 |
_aXVI, 580 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 ; _v3831 |
|
505 | 0 | _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 PRMLfor 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. | |
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aComputer networks . _931572 |
|
650 | 0 |
_aSoftware engineering. _94138 |
|
650 | 0 |
_aDatabase management. _93157 |
|
650 | 0 |
_aInformation storage and retrieval systems. _922213 |
|
650 | 0 |
_aApplication software. _9176126 |
|
650 | 1 | 4 |
_aTheory of Computation. _9176127 |
650 | 2 | 4 |
_aComputer Communication Networks. _9176128 |
650 | 2 | 4 |
_aSoftware Engineering. _94138 |
650 | 2 | 4 |
_aDatabase Management. _93157 |
650 | 2 | 4 |
_aInformation Storage and Retrieval. _923927 |
650 | 2 | 4 |
_aComputer and Information Systems Applications. _9176129 |
700 | 1 |
_aWiedermann, Jirí. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9176130 |
|
700 | 1 |
_aTel, Gerard. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9176131 |
|
700 | 1 |
_aPokorný, Jaroslav. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9176132 |
|
700 | 1 |
_aBieliková, Mária. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9176133 |
|
700 | 1 |
_aŠtuller, Július. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9176134 |
|
710 | 2 |
_aSpringerLink (Online service) _9176135 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540311980 |
776 | 0 | 8 |
_iPrinted edition: _z9783540819523 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3831 _9176136 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/11611257 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c97512 _d97512 |