Del i serien Lecture Notes in Computer Science

SOFSEM 2005: Theory and Practice of Computer Science

31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings

Häftad, Engelska, 2005

AvMaria Bieliková,Charon-Bost,Ondrej Sýkora,Peter Vojtás

719 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the 31st Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2004, held in Liptovsk� Jan, Slovakia in January 2005.The 28 revised full papers and 16 revised short papers presented together with 8 invited contributions were carefully reviewed and selected from 144 submissions. The papers were organized in four topical tracks on foundations of computer science, modeling and searching data in the web area, software engineering, and graph drawing and discrete computational mathematics.

Produktinformation

Utgivningsdatum2005-01-27
Mått155 x 235 x 25 mm
Vikt674 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor428
Upplaga2005
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540243021

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

Invited Talks.- Discovering Treewidth.- From Research Prototypes to Industrial Strength Open Source Products – The ObjectWeb Experience.- How Hard Is It to Take a Snapshot?.- Logical Foundations for Data Integration.- Recent Advances in Graph Drawing.- The Hyperdatabase Network – New Middleware for Searching and Maintaining the Information Space.- Architecture of a Business Framework for the .NET Platform and Open Source Environments.- Progress on Crossing Number Problems.- Full Contributed Papers.- Greedy Differential Approximations for Min Set Cover.- A Methodology of Visual Modeling Language Evaluation.- Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem.- A Hierarchical Markovian Mining Approach for Favorite Navigation Patterns.- Non-planar Orthogonal Drawings with Fixed Topology.- A Topology-Driven Approach to the Design of Web Meta-search Clustering Engines.- Computing Upward Planar Drawings Using Switch-Regularity Heuristics.- Serial and Parallel Multilevel Graph Partitioning Using Fixed Centers.- Two-Layer Planarization: Improving on Parameterized Algorithmics.- On the Stability of Approximation for Hamiltonian Path Problems.- Robustness of Composed Timed Systems.- Topology Generation for Web Communities Modeling.- Recursion Versus Replication in Simple Cryptographic Protocols.- Modeling Data Integration with Updateable Object Views.- Fixed-Parameter Tractable Algorithms for Testing Upward Planarity.- Read/Write Based Fast-Path Transformation for FCFS Mutual Exclusion.- Adjustment of Indirect Association Rules for the Web.- Anonymous Communication with On-line and Off-line Onion Encoding.- Characteristic Patterns for LTL.- Planar Straight-Line Drawing in an Grid with Angular Resolution (1/n).- Modeling NestedRelationships in XML Documents Using Relational Databases.- RAQ: A Range-Queriable Distributed Data Structure.- On Some Weighted Satisfiability and Graph Problems.- On the Security and Composability of the One Time Pad.- Lower Bounds on the OBDD Size of Graphs of Some Popular Functions.- XML-Based Declarative Access Control.- VCD: A Visual Formalism for Specification of Heterogeneous Software Architectures.- Cost-Constrained Minimum-Delay Multicasting.- Ontology-Based Inconsistency Management of Software Requirements Specifications.- The Best Student Paper.- Suffix Tree Based Data Compression.- Short Contributed Papers.- Tier Aspect Model Based on Updatable Views.- Well-Founded Metamodeling for Model-Driven Architecture.- Stepwise Optimization Method for k-CNN Search for Location-Based Service.- An Approach for Integrating Analysis Patterns and Feature Diagrams into Model Driven Architecture.- Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs.- Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance.- Feature Selection by Reordering.- A Management Scheme for the Basic Types in High Level Languages.- Bayesian Networks in Software Maintenance Management.- A Multiagent System Aiding Information Retrieval in Internet Using Consensus Methods.- Interval-Valued Data Structures and Their Application to e-Learning.- Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms.- Representation of Extended RBAC Model Using UML Language.- A Methodology for Writing Class Contracts.- Volumes of 3D Drawings of Homogenous Product Graphs.