4843 search results - page 625 / 969 » The Shortcut Problem - Complexity and Approximation |
163
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Automatic evaluation of visual tracking algorithms in the absence of ground truth is a very challenging and important problem. In the context of online appearance modeling, there ...
118
click to vote
ICCV
2005
IEEE
16 years 6 months ago
2005
IEEE
A wide range of low level vision problems have been formulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest energy configu...
148
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
We address the problem of face recognition from a large set of images obtained over time - a task arising in many surveillance and authentication applications. A set or a sequence ...
269
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
148
click to vote
ICIP
2006
IEEE
16 years 6 months ago
2006
IEEE
Traditional snakes, or active contours, are planar parametric curves. Their parameters are determined by optimizing the weighted sum of three energy terms: one depending on the dat...