57 search results - page 11 / 12 » Generalizations of matched CNF formulas |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
EJASP
2010
13 years 2 months ago
2010
We adopt the concept of channel diagonalization to time-frequency signal expansions obtained by DFT filter banks. As a generalization of the frequency domain channel representatio...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
STOC
1989
ACM
13 years 11 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
Amethod for quick determination of the position and pose of a 3D free-form object with respect to its 2D projective image(s) is proposed. It is a precondition of the method that a...