96 search results - page 6 / 20 » Length-bounded cuts and flows |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
CVPR
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Jer
JNSM
2006
13 years 7 months ago
2006
Two bounds on network coding rates are reviewed that generalize edge-cut bounds on routing rates. The simpler bound is a bidirected cut-set bound which generalizes and improves upo...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...