9532 search results - page 336 / 1907 » Logic, Graphs, and Algorithms |
235
Voted
WDAG
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
235
click to vote
CORR
2012
Springer
14 years 3 months ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
193
click to vote
ECML
2007
Springer
16 years 1 months ago
2007
Springer
We discuss how to learn non-recursive directed probabilistic logical models from relational data. This problem has been tackled before by upgrading the structure-search algorithm i...
207
click to vote
ILP
2004
Springer
16 years 24 days ago
2004
Springer
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
202
click to vote
ML
2008
ACM
15 years 7 months ago
2008
ACM
Abstract. Recently, there has been an increasing interest in directed probabilistic logical models and a variety of languages for describing such models has been proposed. Although...