855 search results - page 87 / 171 » Complexity of Equations over Sets of Natural Numbers |
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
122
click to vote
ML
2012
ACM
13 years 5 months ago
2012
ACM
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
SECURWARE
2008
IEEE
15 years 4 months ago
2008
IEEE
Filtering is a very important issue in next generation networks. These networks consist of a relatively high number of resource constrained devices with very special features, suc...