4843 search results - page 720 / 969 » The Shortcut Problem - Complexity and Approximation |
169
click to vote
SIAMIS
2011
14 years 10 months ago
2011
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
152
click to vote
IPL
2010
14 years 10 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
166
Voted
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Graph-based methods form a main category of semisupervised
learning, offering flexibility and easy implementation
in many applications. However, the performance of
these methods...
165
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
In this paper we propose a robust visual tracking method
by casting tracking as a sparse approximation problem in a
particle filter framework. In this framework, occlusion, corru...
110
click to vote
CVPR
2000
IEEE
16 years 5 months ago
2000
IEEE
We introduce a fast, multiscale algorithm for image segmentation. Our algorithm uses modern numeric techniques to nd an approximate solution to normalized cut measures in time tha...