Computer Science – Theory and Applications First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12. 2006. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Grigoriev, Dima (Επιμελητής έκδοσης), Harrison, John (Επιμελητής έκδοσης), Hirsch, Edward A. (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.
Σειρά:Lecture Notes in Computer Science, 3967
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 06344nam a22005775i 4500
001 978-3-540-34168-0
003 DE-He213
005 20151204180947.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 |a 9783540341680  |9 978-3-540-34168-0 
024 7 |a 10.1007/11753728  |2 doi 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
072 7 |a UY  |2 bicssc 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a COM031000  |2 bisacsh 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Computer Science – Theory and Applications  |h [electronic resource] :  |b First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12. 2006. Proceedings /  |c edited by Dima Grigoriev, John Harrison, Edward A. Hirsch. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2006. 
300 |a XVI, 684 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 3967 
505 0 |a Invited Papers -- Non-black-box Techniques in Cryptography -- Complexity of Polynomial Multiplication over Finite Fields -- Synchronous Elastic Circuits -- Theory Track -- SZK Proofs for Black-Box Group Problems -- Canonical Decomposition of a Regular Factorial Language -- Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure -- Inductive Type Schemas as Functors -- Unfolding Synthesis of Asynchronous Automata -- Conjugacy and Equivalence of Weighted Automata and Functional Transducers -- Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees -- Tuples of Disjoint NP-Sets -- Constructive Equivalence Relations on Computable Probability Measures -- Planar Dimer Tilings -- The Complexity of Equality Constraint Languages -- Window Subsequence Problems for Compressed Texts -- Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties -- Relativisation Provides Natural Separations for Resolution-Based Proof Systems -- Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems -- Isolation and Reducibility Properties and the Collapse Result -- Incremental Branching Programs -- Logic of Proofs for Bounded Arithmetic -- On a Maximal NFA Without Mergible States -- Expressiveness of Metric Modalities for Continuous Time -- Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction -- Weighted Logics for Traces -- On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone -- Unwinding a Non-effective Cut Elimination Proof -- Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover -- Shannon Entropy vs. Kolmogorov Complexity -- Language Equations with Symmetric Difference -- On Primitive Recursive Realizabilities -- Evidence Reconstruction of Epistemic Modal Logic S5 -- Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms -- On the Frequency of Letters in Morphic Sequences -- Functional Equations in Shostak Theories -- All Semi-local Longest Common Subsequences in Subquadratic Time -- Non-approximability of the Randomness Deficiency Function -- Multi-agent Explicit Knowledge -- Applications and Technology Track -- Polarized Subtyping for Sized Types -- Neural-Network Based Physical Fields Modeling Techniques -- Approximate Methods for Constrained Total Variation Minimization -- Dynamic Isoline Extraction for Visualization of Streaming Data -- Improved Technique of IP Address Fragmentation Strategies for DoS Attack Traceback -- Performance Comparison Between Backpropagation, Neuro-Fuzzy Network, and SVM -- Evolutionary Multi-objective Optimisation by Diversity Control -- 3D Facial Recognition Using Eigenface and Cascade Fuzzy Neural Networks: Normalized Facial Image Approach -- A New Scaling Kernel-Based Fuzzy System with Low Computational Complexity -- Bulk Synchronous Parallel ML: Semantics and Implementation of the Parallel Juxtaposition -- A Shortest Path Algorithm Based on Limited Search Heuristics -- A New Hybrid Directory Scheme for Shared Memory Multi-processors -- Manipulator Path Planning in 3-Dimensional Space -- Least Likely to Use: A New Page Replacement Strategy for Improving Database Management System Response Time -- Nonlinear Visualization of Incomplete Data Sets -- A Review of Race Detection Mechanisms -- Fuzzy-Q Knowledge Sharing Techniques with Expertness Measures: Comparison and Analysis -- Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics -- Analytic Modeling of Channel Traffic in n-Cubes -- Capturing an Intruder in the Pyramid -- Speech Enhancement in Short-Wave Channel Based on Empirical Mode Decomposition -- Extended Resolution Proofs for Conjoining BDDs -- Optimal Difference Systems of Sets with Multipliers -- Authentication Mechanism Using One-Time Password for 802.11 Wireless LAN -- Optimizing Personalized Retrieval System Based on Web Ranking -- Instruction Selection for ARM/Thumb Processors Based on a Multi-objective Ant Algorithm -- A New Flow Control Algorithm for High Speed Computer Network -- Nonlinear Systems Modeling and Control Using Support Vector Machine Technique -- Fast Motif Search in Protein Sequence Databases. 
650 0 |a Computer science. 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Bioinformatics. 
650 1 4 |a Computer Science. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Computation by Abstract Devices. 
650 2 4 |a Computing Methodologies. 
650 2 4 |a Mathematics of Computing. 
650 2 4 |a Bioinformatics. 
700 1 |a Grigoriev, Dima.  |e editor. 
700 1 |a Harrison, John.  |e editor. 
700 1 |a Hirsch, Edward A.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540341666 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 3967 
856 4 0 |u http://dx.doi.org/10.1007/11753728  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)