Sciweavers

3244 search results - page 10 / 649
» On convex complexity measures
Sort
View
ICPR
2008
IEEE
15 years 10 months ago
Image segmentation by convex quadratic programming
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 ...
Mariano Rivera, Oscar Dalmau Cedeño, Josue ...
72
Voted
TCS
2002
14 years 9 months ago
Complexity measures and decision tree complexity: a survey
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
Harry Buhrman, Ronald de Wolf
BVAI
2005
Springer
15 years 3 months ago
Algorithm That Mimics Human Perceptual Grouping of Dot Patterns
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...
Giuseppe Papari, Nicolai Petkov
ISIPTA
1999
IEEE
15 years 1 months ago
Nonlinear Filtering of Convex Sets of Probability Distributions
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...
John Kenney, Wynn C. Stirling
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
15 years 1 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
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...
Markus A. Hitz, Erich Kaltofen