1026 search results - page 3 / 206 » On Finding Minimal w-cutset |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Let S be a finite set of words such that Fact(S ) = . We deal with the problem of finding bounds on the minimal length of words in \ Fact(S ) in terms of the maximal length of wor...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
DIS
2007
Springer
14 years 1 months ago
2007
Springer
Abductive inference has long been associated with the logic of scientific discovery and automated abduction is now being used in real scientific tasks. But few methods can exploi...
SAT
2005
Springer
14 years 1 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...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...