Cantitate/Preț
Produs

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: Lecture Notes in Computer Science, cartea 4910

Editat de Villiam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková
en Limba Engleză Paperback – 11 ian 2008

Din seria Lecture Notes in Computer Science

Preț: 64549 lei

Preț vechi: 80686 lei
-20% Nou

Puncte Express: 968

Preț estimativ în valută:
12354 13033$ 10295£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540775652
ISBN-10: 354077565X
Pagini: 814
Ilustrații: XV, 792 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 1.12 kg
Ediția:2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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 MatrixInterpretations.- 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 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.- 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.