99 search results - page 3 / 20 » Stable normal forms for polynomial system solving |
ACTA
2007
13 years 7 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
ENTCS
2006
13 years 7 months ago
2006
Being able to systematically change the original architecture of a component-based system to a desired target architecture without changing the set of functional requirements of t...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Various problems in AI can be solved by translating them into a quantified boolean formula (QBF) and evaluating the resulting encoding. In this approach, a QBF solver is used as a ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that RT R is close to AT A. Thus, when the algorithm is used ...
ICCV
1995
IEEE
13 years 11 months ago
1995
IEEE
Abstract. We describe a flexible object recognition and modelling system (FORMS) which represents and recognizes animate objects from their silhouettes. This consists of a model fo...