An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
This paper considers grasps and fixtures whose contacts react according to force-displacement laws consistent with friction constrains at the contacts. The passive force closure s...
We present a method for segmenting white matter tracts from high angular resolution diffusion MR images by representing the data in a 5 dimensional space of position and orientatio...
Lisa Jonasson, Patric Hagmann, Xavier Bresson, Jea...
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...