123 search results - page 9 / 25 » Computing upper and lower bounds on likelihoods in intractab... |
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
JAIR
2010
13 years 5 months ago
2010
The paper presents a scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power lies in its ability to use any ...
IAJIT
2011
12 years 10 months ago
2011
: Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compa...
TDSC
2010
13 years 2 months ago
2010
Network survivability is the ability of a network keeping connected under failures and attacks, which is a fundamental issue to the design and performance evaluation of wireless ad...
JMLR
2006
13 years 7 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...