3146 search results - page 242 / 630 » Efficient Consequence Finding |
199
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
240
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
168
click to vote
JAL
2006
15 years 6 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
181
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NP-har...
198
click to vote
CVPR
2001
IEEE
16 years 8 months ago
2001
IEEE
Modeling subspaces of a distribution of interest in high dimensional spaces is a challenging problem in pattern analysis. In this paper, we present a novel framework for pose inva...