The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
We present a novel approach to the problem of hairstyle construction from raw surface data such as the ones obtained from surface scans. Our approach is based on a shape matching ...
Gerrit Sobottka, Michael Kusak, Andreas Weber 0004
In this paper we consider the problem of designing load balancing protocols in distributed systems where the participants (e.g. computers, users) are capable of manipulating the l...
Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast...
– This paper presents a new singularity robust and computationally efficient method for solving the inverse kinematics (IK) problem. In this method, the transformation from Carte...