697 search results - page 36 / 140 » Convex Functions on Discrete Sets |
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
In this paper we introduce a new shape constraint for interactive image segmentation. It is an extension of Veksler's star-convexity prior, in two ways: from a single star to ...
MOR
2006
13 years 8 months ago
2006
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
CDC
2008
IEEE
13 years 9 months ago
2008
IEEE
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
DCG
2010
13 years 9 months ago
2010
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Traditional Non-Negative Matrix Factorization (NMF) [19] is a successful algorithm for decomposing datasets into basis function that have reasonable interpretation. One problem of...