123 search results - page 1 / 25 » Computing upper and lower bounds on likelihoods in intractab... |
UAI
1996
14 years 8 days ago
1996
ASIACRYPT
2008
Springer
14 years 29 days ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
COR
2008
13 years 11 months ago
2008
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
ICML
2005
IEEE
14 years 11 months ago
2005
IEEE
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
NIPS
1998
14 years 9 days ago
1998
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...