485 search results - page 9 / 97 » Iterative Bounding LAO |
JAIR
2010
14 years 8 months ago
2010
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
SAT
2005
Springer
15 years 3 months ago
2005
Springer
We tackle the problem of finding a smallest-cardinality MUS (SMUS) of a given formula. The SMUS provides a succinct explanation of infeasibility and is valuable for applications th...
CCCG
2006
14 years 11 months ago
2006
In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of d...
ICIP
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents an iterative algorithm for approximating gray-scale images with adaptive triangular meshes ensuring a given tolerance. At each iteration, the algorithm applies...
EVOW
2007
Springer
15 years 4 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...