2219 search results - page 249 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
148
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
134
Voted
SIGGRAPH
1997
ACM
15 years 7 months ago
1997
ACM
We present a method of recovering high dynamic range radiance maps from photographs taken with conventional imaging equipment. In our method, multiple photographs of the scene are...
186
click to vote
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
126
Voted
VLSM
2005
Springer
15 years 9 months ago
2005
Springer
We present a mathematical and computational feasibility study of the variational convex decomposition of 2D vector fields into coherent structures and additively superposed flow ...
122
Voted
ESA
2004
Springer
15 years 8 months ago
2004
Springer
The computation of dominators in a flowgraph has applications in several areas, including program optimization, circuit testing, and theoretical biology. Lengauer and Tarjan [30]...