759 search results - page 67 / 152 » Optimal Graph Search with Iterated Graph Cuts |
150
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
120
click to vote
CVPR
2006
IEEE
15 years 10 months ago
2006
IEEE
We introduce the term cosegmentation which denotes the task of segmenting simultaneously the common parts of an image pair. A generative model for cosegmentation is presented. Inf...
145
click to vote
IWOMP
2009
Springer
15 years 10 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
126
click to vote
FOCI
2007
IEEE
15 years 10 months ago
2007
IEEE
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
142
click to vote
UAI
2004
15 years 5 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...