2816 search results - page 60 / 564 » Submodular function minimization |
DM
2006
14 years 10 months ago
2006
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
151
click to vote
ICCV
2011
IEEE
13 years 8 months ago
2011
IEEE
This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of ...
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
A wireless packet network is considered in which each user transmits a stream of packets to its destination. The transmit power of each user interferes with the transmission of al...
EMMCVPR
2005
Springer
15 years 3 months ago
2005
Springer
This paper is devoted to piecewise-constant segmentation of images using a curve evolution approach in a variational formulation. The problem to be solved is also called the minima...
ICCAD
1997
IEEE
15 years 2 months ago
1997
IEEE
We present a novel method for state minimization of incompletely-specified finite state machines. Where classic methods simply minimize the number of states, ours directly addre...