Cargando…

SOFSEM 2006: Theory 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 /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Wiedermann, Jirí (Editor ), Tel, Gerard (Editor ), Pokorný, Jaroslav (Editor ), Bieliková, Mária (Editor ), Štuller, Július (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Edición:1st ed. 2006.
Colección:Theoretical Computer Science and General Issues, 3831
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-32217-7
003 DE-He213
005 20230220124221.0
007 cr nn 008mamaa
008 100410s2006 gw | s |||| 0|eng d
020 |a 9783540322177  |9 978-3-540-32217-7 
024 7 |a 10.1007/11611257  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a SOFSEM 2006: Theory and Practice of Computer Science  |h [electronic resource] :  |b 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, January 21-27, 2006, Proceedings /  |c edited by Jirí Wiedermann, Gerard Tel, Jaroslav Pokorný, Mária Bieliková, Július Štuller. 
250 |a 1st ed. 2006. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2006. 
300 |a XVI, 580 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 3831 
505 0 |a Invited 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. 
650 0 |a Computer science. 
650 0 |a Computer networks . 
650 0 |a Software engineering. 
650 0 |a Database management. 
650 0 |a Information storage and retrieval systems. 
650 0 |a Application software. 
650 1 4 |a Theory of Computation. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Software Engineering. 
650 2 4 |a Database Management. 
650 2 4 |a Information Storage and Retrieval. 
650 2 4 |a Computer and Information Systems Applications. 
700 1 |a Wiedermann, Jirí.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Tel, Gerard.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Pokorný, Jaroslav.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Bieliková, Mária.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Štuller, Július.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540819523 
776 0 8 |i Printed edition:  |z 9783540311980 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 3831 
856 4 0 |u https://doi.uam.elogim.com/10.1007/11611257  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)