80 search results - page 2 / 16 » A fast cost scaling algorithm for submodular flow |
TON
2008
13 years 5 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
ICVS
2009
Springer
14 years 6 days ago
2009
Springer
The faithful detection of the motion and of the distance of the objects in the visual scene is a desirable feature of any artificial vision system designed to operate in unknown e...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Abstract--In wireless networks, important network functionalities such as power control, rate allocation, routing, and congestion control must be optimized in a coherent and integr...
TON
2010
13 years 4 months ago
2010
— We adopt the network coding approach to achieve minimum-cost multicast in interference-limited wireless networks where link capacities are functions of the signal-to-noise-plus...
BMVC
2000
13 years 7 months ago
2000
In this study we seek a fast method for robust, boundary preserving estimation of optical flow. Several studies have addressed this topic and proposed methods that account for vel...