Sciweavers

691 search results - page 53 / 139
» Automatically Proving Linearizability
Sort
View
ER
2004
Springer
82views Database» more  ER 2004»
14 years 3 months ago
Reachability Problems in Entity-Relationship Schema Instances
Abstract. Recent developments in reification of ER schemata include automatic generation of webbased database administration systems [1,2]. These systems enforce the schema cardin...
Sebastiano Vigna
ICPR
2002
IEEE
14 years 2 months ago
Image Segmentation Using Gradient Vector Diffusion and Region Merging
Active Contour (or Snake) Model is recognized as one of the efficient tools for 2D/3D image segmentation. However, traditional snake models prove to be limited in several aspects...
Zeyun Yu, Chandrajit L. Bajaj
CADE
2001
Springer
14 years 2 months ago
Approximating Dependency Graphs Using Tree Automata Techniques
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
Aart Middeldorp
CSL
2006
Springer
14 years 1 months ago
On Rational Trees
Rational graphs are a family of graphs defined using labelled rational transducers. Unlike automatic graphs (defined using synchronized transducers) the first order theory of these...
Arnaud Carayol, Christophe Morvan
MKWI
2008
157views Business» more  MKWI 2008»
13 years 11 months ago
Semantic-Based Planning of Process Models
: Process modelling has proved to be a powerful instrument to describe and manage the increasingly complex processes within and across enterprises. Yet, it requires a significant a...
Matthias Henneberger, Bernd Heinrich, Florian Laut...