Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
— In a wide range of applications the orientation of a rigid body does not need to be restricted to one given orientation, but can be given as a continuous set of frames. We addr...