136 search results - page 16 / 28 » Experimental Study of Minimum Cut Algorithms |
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
129
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
ICIP
2005
IEEE
15 years 3 months ago
2005
IEEE
Reference picture selection (RPS) is the most common error resilience method for robust transmission over lossy networks. However, RPS has been studied for use in realtime encodin...
AAAI
1996
14 years 11 months ago
1996
If a state space is not completely known in advance, then search algorithms have to explore it sufficiently to locate a goal state and a path leading to it, performing therefore w...