80 search results - page 10 / 16 » Cut problems in graphs with a budget constraint |
ICCV
2001
IEEE
15 years 11 months ago
2001
IEEE
We propose a method of image segmentation by integrating pairwise attraction and directional repulsion derived from local grouping and figure-ground cues. These two kinds of pairw...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Occlusion and lack of visibility in dense crowded scenes make it very difficult to track individual people correctly and consistently. This problem is particularly hard to tackle i...
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
104
click to vote
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...