We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
Sensor networks are being widely deployed for measurement, detection and surveillance applications. In these new applications, users issue long-running queries over a combination o...
Philippe Bonnet, Johannes Gehrke, Praveen Seshadri
We propose Action-Reaction Learning as an approach for analyzing and synthesizing human behaviour. This paradigm uncovers causal mappings between past and future events or between...
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
We present an extension to the Lasso [9] for binary classification problems with ordered attributes. Inspired by the Fused Lasso [8] and the Group Lasso [10, 4] models, we aim to...