|
|
|
|
| LEADER |
06001nmm a2200469 u 4500 |
| 001 |
EB000380100 |
| 003 |
EBX01000000000000000233152 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9783540775669
|
| 100 |
1 |
|
|a Geffert, Villiam
|e [editor]
|
| 245 |
0 |
0 |
|a SOFSEM 2008: Theory and Practice of Computer Science
|h Elektronische Ressource
|b 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings
|c edited by Villiam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková
|
| 250 |
|
|
|a 1st ed. 2008
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2008, 2008
|
| 300 |
|
|
|a XV, 792 p
|b online resource
|
| 505 |
0 |
|
|a Invited Talks -- Quantum Random Walks – New Method for Designing Quantum Algorithms -- Social Information Access: The Other Side of the Social Web -- Designing Adaptive Web Applications -- Best of Both: Using Semantic Web Technologies to Enrich User Interaction with the Web and Vice Versa -- On the Hardness of Reoptimization -- Describing Self-assembly of Nanostructures -- On the Undecidability of the Tiling Problem -- Remote Entrusting by Run-Time Software Authentication -- Trusted Computing — Special Aspects and Challenges -- Optimizing Winning Strategies in Regular Infinite Games -- Foundations of Computer Science -- Recursive Domain Equations of Filter Models -- Algorithmic Problems for Metrics on Permutation Groups -- Periodic and Infinite Traces in Matrix Semigroups -- From Asynchronous to Synchronous Specifications for Distributed Program Synthesis -- Exact OBDD Bounds for Some Fundamental Functions --
|
| 505 |
0 |
|
|a Proofs of Communication and Its Application for Fighting Spam -- Web Pages Reordering and Clustering Based on Web Patterns -- Compression of Concatenated Web Pages Using XBW -- The Dynamic Web Presentations with a Generality Model on the News Domain -- A Highly Efficient XML Compression Scheme for the Web -- Improving Semantic Search Via Integrated Personalized Faceted and Visual Graph Navigation
|
| 505 |
0 |
|
|a A Memetic Algorithm for Global Induction of Decision Trees -- Geometric Rates of Approximation by Neural Networks -- A Sensitive Metaheuristic for Solving a Large Optimization Problem -- Networks, Security, and Cryptography -- Domain Name System as a Memory and Communication Medium -- Strong Authentication over Lock-Keeper -- Short Ballot Assumption and Threeballot Voting Protocol -- Practical Deniable Encryption -- Taming of Pict -- Classification, Formalization and Verification of Security Functional Requirements -- ONN the Use of Neural Networks for Data Privacy -- Threshold Privacy Preserving Keyword Searches -- Web Technologies -- 3D_XML: A Three-Dimensional XML-Based Model -- Visual Exploration of RDF Data -- Creation, Population and Preprocessing of Experimental Data Sets forEvaluation of Applications for the Semantic Web -- Algorithm for Intelligent Prediction of Requests in Business Systems -- Mining Personal Social Features in the Community of Email Users --
|
| 505 |
0 |
|
|a Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers -- A Useful Bounded Resource Functional Language -- On Reachability Games of Ordinal Length -- An Algorithm for Computation of the Scene Geometry by the Log-Polar Area Matching Around Salient Points -- The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring -- How Much Information about the Future Is Needed? -- On Compiling Structured Interactive Programs with Registers and Voices -- Optimal Orientation On-Line -- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality -- Assisted Problem Solving and Decompositions of Finite Automata -- Energy-Efficient Windows Scheduling -- A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns -- Certification of Proving Termination of Term Rewriting by MatrixInterpretations -- Extension of Rescheduling Based on Minimal Graph Cut --
|
| 505 |
0 |
|
|a Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets -- Computing Longest Common Substring and All Palindromes from Compressed Strings -- Basic Sets in the Digital Plane -- Algebraic Optimization of Relational Queries with Various Kinds of Preferences -- Mortality Problem for 2×2 Integer Matrices -- Element Distinctness and Sorting on One-Tape Off-Line Turing Machines -- Improved Bounds for Range Mode and Range Median Queries -- An Automata Theoretic Approach to Rational Tree Relations -- Slicing Petri Nets with an Application to Workflow Verification -- Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata -- Verifying Parameterized taDOM+ Lock Managers -- Untangling a Planar Graph -- Computing by Nature -- Quantum Walks with Multiple or Moving Marked Locations -- Parallel Immune System for Graph Coloring -- The Quantum Complexity of Group Testing -- Quantum Walks: A Markovian Perspective --
|
| 653 |
|
|
|a Computer Communication Networks
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Software Engineering
|
| 653 |
|
|
|a Database Management
|
| 653 |
|
|
|a Data mining
|
| 653 |
|
|
|a Application software
|
| 653 |
|
|
|a Computer networks
|
| 653 |
|
|
|a Data Mining and Knowledge Discovery
|
| 653 |
|
|
|a Computer and Information Systems Applications
|
| 653 |
|
|
|a Theory of Computation
|
| 653 |
|
|
|a Database management
|
| 700 |
1 |
|
|a Karhumäki, Juhani
|e [editor]
|
| 700 |
1 |
|
|a Bertoni, Alberto
|e [editor]
|
| 700 |
1 |
|
|a Preneel, Bart
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
| 028 |
5 |
0 |
|a 10.1007/978-3-540-77566-9
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-540-77566-9?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|