1795 search results - page 325 / 359 » On the Complexity of Circuit Satisfiability |
BMCBI
2007
13 years 10 months ago
2007
Background: Reverse engineering cellular networks is currently one of the most challenging problems in systems biology. Dynamic Bayesian networks (DBNs) seem to be particularly su...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
TIFS
2008
13 years 9 months ago
2008
This paper presents two vector watermarking schemes that are based on the use of complex and quaternion Fourier transforms and demonstrates, for the first time, how to embed waterm...
CORR
1998
Springer
13 years 9 months ago
1998
Springer
Phrase structure trees have a hierarchical structure. In many subjects, most notably in taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierar...
AI
2011
Springer
13 years 4 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...