A quadratic programming formulation for multiclass image segmentation is investigated. It is proved that, in the convex case, the non-negativity constraint on the recent reported ...
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
A solution is provided to the problem of computing a convex set of conditional probability distributions that characterize the state of a nonlinear dynamic system as it evolves in...
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...