2219 search results - page 200 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
312
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper addresses the problem of simultaneous tracking of multiple targets in a video. We first apply object detectors to every video frame. Pairs of detection responses from ...
141
click to vote
CVPR
2011
IEEE
14 years 6 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
154
click to vote
RECOMB
2004
Springer
16 years 3 months ago
2004
Springer
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
140
Voted
ICLP
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
110
click to vote
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...