Designing Reliable Algorithms in Unreliable Memories -- From Balanced Graph Partitioning to Balanced Metric Labeling -- Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism -- Exploring an Unknown Graph Efficiently -- Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio -- Heuristic Improvements for Computing Maximum Multicommodity Flow and Minim…
Editors’ Introduction -- Editors’ Introduction -- Invited Papers -- Invention and Artificial Intelligence -- The Arrowsmith Project: 2005 Status Report -- The Robot Scientist Project -- Algorithms and Software for Collaborative Discovery from Autonomous, Semantically Heterogeneous, Distributed Information Sources -- Training Support Vector Machines via SMO-Type Decomposition Methods -- Kern…
Session I: Steganography and Steganalysis -- A New Approach to Estimating Hidden Message Length in Stochastic Modulation Steganography -- Information Transmission and Steganography -- On the Existence of Perfect Stegosystems -- Towards Multi-class Blind Steganalyzer for JPEG Images -- Session II: Fingerprinting -- An Efficient Fingerprinting Scheme with Symmetric and Commutative Encryption -- C…
Invited Lecture -- Reversible Data Hiding -- Fingerprinting Curves -- Informed Detection Revisited -- Session I: Systems -- A Counter-Geometric Distortions Data Hiding Scheme Using Double Channels in Color Images -- A Secure Internet-Based Personal Identity Verification System Using Lossless Watermarking and Fingerprint Recognition -- Better Use of Human Visual Model in Watermarking Based on Li…
Global optimization -- The Motivation for Differential Evolution -- Critical values for the control parameters of differential evolution algorithms -- The Differential Evolution Algorithm -- Fast Evolution Strategies -- Benchmarking Differential Evolution -- On the usage of differential evolution for function optimization -- Problem Domains -- Shape design and optimization by genetic algorithm …
Invited Lecture -- Robust Airline Fleet Assignment:Imposing Station Purity Using Station Decomposition -- Computing the Arrow-Debreu Competitive Market Equilibrium and Its Extensions -- Contributed Papers -- Complexity of Minimal Tree Routing and Coloring -- Energy Efficient Broadcasting and Multicasting in Static Wireless Ad Hoc Networks -- An Algorithm for Nonconvex Lower Semicontinuous Optim…
Classification and Taxonomy -- Single-Path and Standard Path Switching Fabrics -- Two Stage Swithching Fabrics -- Three-Stage Switching Fabrics -- Replicated Baseline Switching Fabrics.This state-of-the-art survey of switching fabric architectures gives special attention to combinatorial properties of switching fabrics – nonblockingness and rearrangeability. Also describing control algorithms…
Fundamentals -- Foiling the Adversary -- Fingerprinting -- Success Amplification and Random Sampling -- Abundance of Witnesses -- Optimization and Random Rounding.Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their determinist…
Oral Presentations -- Blurred Correlation Versus Correlation Blur -- A Scale Invariant Covariance Structure on Jet Space -- Essential Loops and Their Relevance for Skeletons and Symmetry Sets -- Pre-symmetry Sets of 3D Shapes -- Deep Structure of Images in Populations Via Geometric Models in Populations -- Estimating the Statistics of Multi-object Anatomic Geometry Using Inter-object Relationsh…
Streams, Security and Scalability -- Towards Privacy-Enhanced Authorization Policies and Languages -- Revocation of Obligation and Authorisation Policy Objects -- Role Slices: A Notation for RBAC Permission Assignment and Enforcement -- Designing Secure Indexes for Encrypted Databases -- Efficiency and Security Trade-Off in Supporting Range Queries on Encrypted Databases -- Verified Query Resul…