2746 search results - page 244 / 550 » Bisubmodular Function Minimization |
129
click to vote
ICCV
2005
IEEE
15 years 10 months ago
2005
IEEE
We wish to endow the manifold M of smooth curves in lRn with a Riemannian metric that allows us to treat continuous morphs (homotopies) between two curves c0 and c1 as trajectorie...
154
click to vote
IWDC
2005
Springer
15 years 10 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
143
click to vote
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
187
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Cross-domain learning methods have shown promising
results by leveraging labeled patterns from auxiliary domains
to learn a robust classifier for target domain, which
has a limi...
119
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...