Sofsem 2014: theory and practice of computer science : 40th international conference on current trends in theory and practice of computer science, nový smokovec, slovakia, january 26-29, 2014, proceedings / edited by Viliam Geffert, Bart Preneel, Branislav Rovan, Július Štuller, A Min Tjoa.

Springer eBooks

Invited Papers -- Open Services for Software Process Compliance Engineering -- Episode-Centric Conceptual Modeling -- Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems -- Advice Complexity: Quantitative Approach to A-Priori Information -- Matching of Images of Non-Planar Objects with View Synthesis -- Agile Requirements Engineering: A Research Perspective -- Contributed Papers -- Fitting Planar Graphs on Planar Maps -- Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth -- Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem -- On the Power of Advice and Randomization for the Disjoint Path Allocation Problem -- Goal-Based Establishment of an Information Security Management System Compliant to ISO 27001 -- ProofBook: An Online Social Network Based on Proof-of-Work and Friend-Propagation -- Platform Independent Software Development Monitoring: Design of an Architecture -- Towards Unlocking the Full Potential of Multileaf Collimators -- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs -- Error-Pruning in Interface Automata -- Aspect-Driven Design of Information Systems -- Exact Algorithms to Clique-Colour Graphs -- Supporting Non-Functional Requirements in Services Software Development Process: an MDD Approach -- Safety Contracts for Timed Reactive Components in SysML -- Graph Clustering with Surprise: Complexity and Exact Solutions -- On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms -- Active Learning of Recursive Functions by Ultrametric Algorithms -- Efficient Error-Correcting Codes for Sliding Windows -- Integrating UML Composite Structures and fUML -- Deciding the Value 1 Problem for #-Acyclic Partially Observable Markov Decision Processes -- Bidimensionality of Geometric Intersection Graphs -- Attack Against a Pairing Based Anonymous Authentication Protocol -- Finding Disjoint Paths in Split Graphs -- A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing -- A Stronger Square Conjecture on Binary Words -- DSL Based Platform for Business Process Management -- Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints -- Deterministic Verification of Integer Matrix Multiplication in Quadratic Time -- Comparison of Genetic Algorithms for Trading Strategies -- Probabilistic Admissible Encoding on Elliptic Curves -Towards PACE with Generalized Integrated Mapping -- An Algebraic Framework for Modeling of Reactive Rule-Based Intelligent Agents -- Parameterized Prefix Distance Between Regular Languages -- Ordered Restarting Automata for Picture Languages -- Unary NFAs with Limited Nondeterminism -- Recommending for Disloyal Customers with Low Consumption Rate -- Security Constraints in Modeling of Access Control Rules for Dynamic Information Systems -- A New Plane-Sweep Algorithm for the K-Closest-Pairs Query -- Mastering Erosion of Software Architecture in Automotive Software Product Lines -- Shortest Unique Substrings Queries in Optimal Time -- Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages.

Para consulta fuera de la UANL se requiere clave de acceso remoto.