A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
Shant Karakashian, Robert J. Woodward, Berthe Y. C...
Generalization of spatial databases consists of complicated operations including not only geometric transformations but also topological changes. The changes often result in an inc...
Abstract—We describe BPELCheck, a tool for statically analyzing interactions of composite web services implemented in BPEL. Our algorithm is compositional, and checks each proces...
Jeffrey Fischer, Rupak Majumdar, Francesco Sorrent...
To edit or create the animation of a 3D character model has always been an important but time-consuming task, since the animator usually needs to set up the character’s skeleton,...