FEEDBACK Smiley face
Normal view MARC view ISBD view

SOFSEM 2008: Theory and Practice of Computer Science [electronic resource] :34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008. Proceedings /

Contributor(s): Geffert, Viliam [editor.] | Karhumäki, Juhani [editor.] | Bertoni, Alberto [editor.] | Preneel, Bart [editor.] | Návrat, Pavol [editor.] | Bieliková, Mária [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 4910Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.Description: XV, 792 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540775669.Subject(s): Computer science | Computer communication systems | Software engineering | Computers | Database management | Data mining | Computer Science | Theory of Computation | Software Engineering | Computer Communication Networks | Database Management | Data Mining and Knowledge Discovery | Information Systems Applications (incl. Internet)Online resources: Click here to access online
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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in