4843 search results - page 624 / 969 » The Shortcut Problem - Complexity and Approximation |
149
click to vote
SIGECOM
2004
ACM
15 years 10 months ago
2004
ACM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
119
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
144
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Subspace segmentation is the task of segmenting data
lying on multiple linear subspaces. Its applications in
computer vision include motion segmentation in video,
structure-from...
153
click to vote
CVPR
2001
IEEE
16 years 6 months ago
2001
IEEE
Model Abstraction from Examples Yakov Keselman, Member, IEEE, and Sven Dickinson, Member, IEEE The recognition community has typically avoided bridging the representational gap bet...
133
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
When performing subspace modelling of data using Principal Component Analysis (PCA) it may be desirable to constrain certain directions to be more meaningful in the context of the...