Sciweavers

3415 search results - page 180 / 683
» Lower Bounds for Kernelizations
Sort
View
ICAART
2010
INSTICC
16 years 1 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
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...
Christos Dimitrakakis
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 4 months ago
Sharp Bounds on the Entropy of the Poisson Law and Related Quantities
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. ...
José A. Adell, Alberto Lekuona, Yaming Yu
TIT
2010
76views Education» more  TIT 2010»
14 years 11 months ago
Tighter bounds on the capacity of finite-state channels via Markov set-chains
The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new ...
Jun Chen, Haim H. Permuter, Tsachy Weissman
ICASSP
2011
IEEE
14 years 8 months ago
Optimized capacity bounds for the MIMO relay channel
This paper addresses the optimization of upper and lower bounds on the capacity of the multiple-input multiple-output (MIMO) relay channel. In particular, we show that evaluating ...
Lennart Gerdes, Wolfgang Utschick
161
Voted
KDD
2009
ACM
230views Data Mining» more  KDD 2009»
16 years 5 months ago
Cross domain distribution adaptation via kernel mapping
When labeled examples are limited and difficult to obtain, transfer learning employs knowledge from a source domain to improve learning accuracy in the target domain. However, the...
ErHeng Zhong, Wei Fan, Jing Peng, Kun Zhang, Jiang...