614 search results - page 29 / 123 » Local Computation: Lower and Upper Bounds |
ICAART
2010
INSTICC
14 years 4 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
One of the difficulties in calculating the capacity of certain Poisson channels is that H(), the entropy of the Poisson distribution with mean , is not available in a simple form. ...
NIPS
1998
13 years 8 months 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...
DCC
2000
IEEE
13 years 7 months ago
2000
IEEE
Due to the success of differential and linear attacks on a large number of encryption algorithms, it is importanttoinvestigaterelationshipsamongvariouscryptographic, includingdiffe...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...