Amazon cover image
Image from Amazon.com

SOFSEM 2008 : theory and practice of computer science : 34th Conference on Current Trends in Theory and Practice of Computer Science, Novy Smokovec, Slovakia, January 19-25, 2008 : proceedings / Viliam Geffert [and others] (eds.).

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 4910. | LNCS sublibrary. SL 1, Theoretical computer science and general issues.Publication details: Berlin ; New York : Springer, ©2008.Description: 1 online resource (xv, 792 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540775669
  • 3540775668
  • 9783540775652
  • 354077565X
  • 1281231592
  • 9781281231598
  • 9788354077565
  • 835407756X
Other title:
  • 34th Conference on Current Trends in Theory and Practice of Computer Science
  • Thirty-fourth Conference on Current Trends in Theory and Practice of Computer Science
  • Conference on Current Trends in Theory and Practice of Computer Science
Subject(s): Genre/Form: Additional physical formats: Print version:: SOFSEM 2008.DDC classification:
  • 004 22
LOC classification:
  • QA76.751 .S62 2008eb
Online resources:
Contents:
Front Matter; 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.
Recursive Domain Equations of Filter ModelsAlgorithmic 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 RingHow 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 InterpretationsExtension 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 RelationsSlicing 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; 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.
Summary: Constitutes the refereed proceedings of the 34th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2008, held in Novy Smokovec, Slovakia, in January 2008.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references and index.

Print version record.

Front Matter; 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.

Recursive Domain Equations of Filter ModelsAlgorithmic 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 RingHow 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 InterpretationsExtension 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 RelationsSlicing 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; 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.

Constitutes the refereed proceedings of the 34th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2008, held in Novy Smokovec, Slovakia, in January 2008.

Powered by Koha