1 option
SOFSEM 2008: Theory and Practice of Computer Science : 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings / edited by Villiam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 4910.
- Theoretical Computer Science and General Issues ; 4910
- Language:
- English
- Subjects (All):
- Computers.
- Software engineering.
- Computer networks.
- Database management.
- Data mining.
- Application software.
- Theory of Computation.
- Software Engineering.
- Computer Communication Networks.
- Database Management.
- Data Mining and Knowledge Discovery.
- Information Systems Applications (incl. Internet).
- Local Subjects:
- Theory of Computation.
- Software Engineering.
- Computer Communication Networks.
- Database Management.
- Data Mining and Knowledge Discovery.
- Information Systems Applications (incl. Internet).
- Physical Description:
- 1 online resource (XV, 792 pages).
- Edition:
- First edition 2008.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
- System Details:
- text file PDF
- Contents:
- 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
- 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 Matrix Interpretations
- Extension of Rescheduling Based on Minimal Graph Cut
- 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
- 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 for Evaluation 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
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-77566-9
- 9783540775669
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.