94 search results - page 12 / 19 » Genericity, Randomness, and Polynomial-Time Approximations |
UAI
2004
14 years 11 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
114
click to vote
PODS
2011
ACM
14 years 9 days ago
2011
ACM
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
ISSAC
2007
Springer
15 years 3 months ago
2007
Springer
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in [x, y]. Given a composite polyno...
UAI
1998
14 years 10 months ago
1998
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr childjparents depend monotonically on weighted sums of the parents. In larg...