1658 search results - page 233 / 332 » Learning Unknown Graphs |
CORR
2011
Springer
13 years 5 hour ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
Many real-world domains exhibit rich relational structure and stochasticity and motivate the development of models that combine predicate logic with probabilities. These models de...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Nowadays, enormous amounts of data are continuously generated not only in massive scale, but also from different, sometimes conflicting, views. Therefore, it is important to conso...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...