Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems Fulltext Access 30 Pages 2006
Solving the path cover problem on circular-arc graphs by using an approximation algorithm Fulltext Access 30 Pages 2006
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets Fulltext Access 30 Pages 2006
CSP-CASL—A new integration of process algebra and algebraic specification Fulltext Access 30 Pages 2006
Branching bisimulation for probabilistic systems: Characteristics and decidability Fulltext Access 31 Pages 2006
On a fast, robust estimator of the mode: Comparisons to other robust estimators with applications Fulltext Access 31 Pages 2006
A divide-and-conquer approach in applying EM for large recursive models with incomplete categorical data Fulltext Access 31 Pages 2006
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures Fulltext Access 31 Pages 2006
Ramsey-type theorems for metric spaces with applications to online problems Fulltext Access 32 Pages 2006
On the severity of Braess's Paradox: Designing networks for selfish users is hard Fulltext Access 32 Pages 2006
Multiprocessor scheduling under precedence constraints: Polyhedral results Fulltext Access 32 Pages 2006
Relating State-Based and Process-Based Concurrency through Linear Logic Fulltext Access 32 Pages 2006
An exact and efficient approach for computing a cell in an arrangement of quadrics Fulltext Access 33 Pages 2006
A modular approach to defining and characterising notions of simulation Fulltext Access 34 Pages 2006
Off-line and on-line guaranteed start-up delay for Media-on-Demand with stream merging Fulltext Access 34 Pages 2006
A wide-range algorithm for minimal triangulation from an arbitrary ordering Fulltext Access 34 Pages 2006
Building small equality graphs for deciding equality logic with uninterpreted functions Fulltext Access 34 Pages 2006
To use or not to use the goto statement: Programming styles viewed from Hoare Logic Fulltext Access 35 Pages 2006
Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof 1 Fulltext Access 35 Pages 2006
Experiment selection for the discrimination of semi-quantitative models of dynamical systems Fulltext Access 35 Pages 2006
Errors in discrimination with monotone missing data from multivariate normal populations Fulltext Access 35 Pages 2006
Rewriting queries using views in the presence of arithmetic comparisons Fulltext Access 36 Pages 2006
On augmenting database design-support environments to capture the geo-spatio-temporal data semantics Fulltext Access 36 Pages 2006
Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem Fulltext Access 36 Pages 2006
The MurMur project: Modeling and querying multi-representation spatio-temporal databases Fulltext Access 37 Pages 2006
A Kleene theorem and model checking algorithms for existentially bounded communicating automata Fulltext Access 37 Pages 2006
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering Fulltext Access 38 Pages 2006
Branching and pruning: An optimal temporal POCL planner based on constraint programming Fulltext Access 38 Pages 2006
Exact, efficient, and complete arrangement computation for cubic curves Fulltext Access 38 Pages 2006
On relating functional specifications to architectural specifications: A case study Fulltext Access 38 Pages 2006