000 | 07198nam a22006615i 4500 | ||
---|---|---|---|
001 | 978-3-540-77566-9 | ||
003 | DE-He213 | ||
005 | 20240730173552.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2008 gw | s |||| 0|eng d | ||
020 |
_a9783540775669 _9978-3-540-77566-9 |
||
024 | 7 |
_a10.1007/978-3-540-77566-9 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aSOFSEM 2008: Theory and Practice of Computer Science _h[electronic resource] : _b34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings / _cedited by Villiam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková. |
250 | _a1st ed. 2008. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2008. |
|
300 |
_aXV, 792 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4910 |
|
505 | 0 | _aInvited 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. | |
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aSoftware engineering. _94138 |
|
650 | 0 |
_aComputer networks . _931572 |
|
650 | 0 |
_aDatabase management. _93157 |
|
650 | 0 |
_aData mining. _93907 |
|
650 | 0 |
_aApplication software. _9108800 |
|
650 | 1 | 4 |
_aTheory of Computation. _9108801 |
650 | 2 | 4 |
_aSoftware Engineering. _94138 |
650 | 2 | 4 |
_aComputer Communication Networks. _9108802 |
650 | 2 | 4 |
_aDatabase Management. _93157 |
650 | 2 | 4 |
_aData Mining and Knowledge Discovery. _9108803 |
650 | 2 | 4 |
_aComputer and Information Systems Applications. _9108804 |
700 | 1 |
_aGeffert, Villiam. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9108805 |
|
700 | 1 |
_aKarhumäki, Juhani. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9108806 |
|
700 | 1 |
_aBertoni, Alberto. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9108807 |
|
700 | 1 |
_aPreneel, Bart. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9108808 |
|
700 | 1 |
_aNávrat, Pavol. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9108809 |
|
700 | 1 |
_aBieliková, Mária. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9108810 |
|
710 | 2 |
_aSpringerLink (Online service) _9108811 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540775652 |
776 | 0 | 8 |
_iPrinted edition: _z9783540847113 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4910 _9108812 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-77566-9 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c88989 _d88989 |