270 search results - page 1 / 54 » Exploiting Problem Structure for Solution Counting |
CP
2009
Springer
14 years 5 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
CP
2007
Springer
13 years 11 months ago
2007
Springer
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...
ICIP
2008
IEEE
13 years 11 months ago
2008
IEEE
Widely used SVD-based matrix factorization approaches to the recovery of 3D rigid structure from motion (SFM), require a set of feature points to be visible in a set of images. Wh...
AAAI
2007
13 years 7 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...