365 search results - page 43 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
106
click to vote
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
100
Voted
CP
2007
Springer
15 years 6 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
98
Voted
CVPR
2009
IEEE
16 years 7 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...
105
Voted
ICCAD
1994
IEEE
15 years 4 months ago
1994
IEEE
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
ICIP
2010
IEEE
14 years 10 months ago
2010
IEEE
Quantization, defined as the act of attributing a finite number of grey-levels to an image, is an essential task in image acquisition and coding. It is also intricately linked to ...