307 search results - page 1 / 62 » A Comparison of Algorithms for Connected Set Openings and Cl... |
PAMI
2002
13 years 7 months ago
2002
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
We study domain filtering algorithms for open constraints, i.e., constraints that are not a priori defined on specific sets of variables. We present an efficient filtering algorith...
ICCV
2009
IEEE
15 years 10 days ago
2009
IEEE
We propose a polynomial-time algorithm for segmentation
and (open) boundary estimation which takes into account
a series of user-specified attraction points. In contrast
to exis...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
This paper conducts an in-depth study on a classical perceptual-organization problem: finding salient closed boundaries from a set of boundary fragments detected in a noisy image....