2746 search results - page 384 / 550 » Bisubmodular Function Minimization |
143
click to vote
DAGM
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
157
click to vote
AAAI
2007
15 years 6 months ago
2007
In designing Markov Decision Processes (MDP), one must define the world, its dynamics, a set of actions, and a reward function. MDPs are often applied in situations where there i...
121
click to vote
AAAI
2007
15 years 6 months ago
2007
Recent studies have shown that graph-based approaches are effective for semi-supervised learning. The key idea behind many graph-based approaches is to enforce the consistency bet...
132
click to vote
CIMAGING
2010
15 years 5 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
131
Voted
IPCO
2010
15 years 5 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...