855 search results - page 106 / 171 » Complexity of Equations over Sets of Natural Numbers |
CAV
1999
Springer
15 years 2 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
113
click to vote
CVPR
2004
IEEE
15 years 12 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
AAAI
1998
14 years 11 months ago
1998
Two of the most important threads of work in knowledge representation today are frame-based representation systems (FRS's) and Bayesian networks (BNs). FRS's provide an ...
BMCBI
2004
14 years 9 months ago
2004
Background: An increasing number of researchers have released novel RNA structure analysis and prediction algorithms for comparative approaches to structure prediction. Yet, indep...
ICDT
1999
ACM
15 years 2 months ago
1999
ACM
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...