1142 search results - page 47 / 229 » Approximability of Clausal Constraints |
180
click to vote
ICPR
2008
IEEE
16 years 19 days ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
179
click to vote
CVBIA
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we present a new framework for image segmentation using probabilistic multinets. We apply this framework to integration of regionbased and contour-based segmentation ...
206
click to vote
ESOP
1999
Springer
15 years 10 months ago
1999
Springer
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
159
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...
145
click to vote
CPAIOR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...