We present an approach to decomposing branching volume data into sub-branches. First, a metric is proposed for evaluating local convexities in volumetric data, and it is a criteri...
Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good strategy is difficult; choosing a poor strategy wastes r...
Cormac Gebruers, Brahim Hnich, Derek G. Bridge, Eu...
This paper describes a design space exploration experiment for a real application from the embedded networking domain - the physical layer of a wireless protocol. The application ...
Laura Vanzago, Bishnupriya Bhattacharya, Joel Camb...
Abstract. A special kind of anticipation is when an anticipated undesired situation makes an agent adapt its behavior in order to prevent that this situation will occur. In this ch...
We present a completion-based method for handling a new version of E-unification, called "mixed" E-unification, that is a combination of the classical "universal&quo...