152 search results - page 7 / 31 » Efficiently Exploiting Dependencies in Local Search for SAT |
CPAIOR
2008
Springer
13 years 10 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...
FSTTCS
2000
Springer
14 years 17 days ago
2000
Springer
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
ECCV
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Despite the ubiquitous use of range images in various computer vision applications, little has been investigated about the size variation of the local geometric structure...
CG
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
Image matching is a fundamental task for many applications of computer vision. Today it is very popular to represent two matched images as two bags of local descriptors, and the c...