2746 search results - page 68 / 550 » Bisubmodular Function Minimization |
120
click to vote
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper we propose a novel prior-based variational object segmentation method in a global minimization framework which unifies image segmentation and image denoising. The id...
123
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
—We consider constrained minimization of a sum of convex functions over a convex and compact set, when each component function is known only to a specific agent in a timevarying...
163
click to vote
JGO
2010
15 years 1 months ago
2010
In this paper, the global optimization problem with an objective function that is multiextremal that satisfies the Lipschitz condition over a hypercube is considered. An algorithm...
112
click to vote
KDD
2003
ACM
16 years 3 months ago
2003
ACM
Distance function computation is a key subtask in many data mining algorithms and applications. The most effective form of the distance function can only be expressed in the conte...
132
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...