Sciweavers

Share
VMCAI
2012
Springer
7 years 10 months ago
Ideal Abstractions for Well-Structured Transition Systems
stractions for Well-Structured Transition Systems Damien Zufferey1 , Thomas Wies2 , and Thomas A. Henzinger1 1 IST Austria 2 New York University Many infinite state systems can be...
Damien Zufferey, Thomas Wies, Thomas A. Henzinger
OTM
2010
Springer
9 years 26 days ago
Generic Algorithms for Consistency Checking of Mutual-Exclusion and Binding Constraints in a Business Process Context
In this paper, we present generic algorithms to ensure the consistency of mutual-exclusion and binding constraints in a business process context. We repeatedly identified the need...
Mark Strembeck, Jan Mendling
JALC
2002
97views more  JALC 2002»
9 years 2 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
ETVC
2008
9 years 4 months ago
Statistical Computing on Manifolds: From Riemannian Geometry to Computational Anatomy
Computational anatomy is an emerging discipline that aims at analyzing and modeling the individual anatomy of organs and their biological variability across a population. The goal ...
Xavier Pennec
PLDI
2005
ACM
9 years 8 months ago
Essential language support for generic programming
Concepts are an essential language feature for generic programming in the large. Concepts allow for succinct expression of constraints on type parameters of generic algorithms, en...
Jeremy G. Siek, Andrew Lumsdaine
books