2446 search results - page 251 / 490 » Choiceless Polynomial Time |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
This paper is focused on the Co-segmentation problem
[1] – where the objective is to segment a similar object from
a pair of images. The background in the two images may be
ar...
ICCV
2009
IEEE
15 years 1 months 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
1998
IEEE
14 years 10 months ago
1998
IEEE
We propose a methodfor segmenting gray-value images. By segmentation, we mean a map from the set of pixels to a small set of levels such that each connected component of the set o...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...