Sciweavers

478 search results - page 59 / 96
» Improving probability bounds by optimization over subsets
Sort
View
DCOSS
2006
Springer
13 years 11 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
INFOCOM
2010
IEEE
13 years 5 months ago
Green Wave: Latency and Capacity-Efficient Sleep Scheduling for Wireless Networks
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...
Saikat Guha, Chi-Kin Chau, Prithwish Basu
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
The Impact of CSI and Power Allocation on Relay Channel Capacity and Cooperation Strategies
Capacity gain from transmitter and receiver cooperation are compared in a relay network where the cooperating nodes are close together. Under quasi-static channels, when all nodes...
Chris T. K. Ng, Andrea J. Goldsmith
JMLR
2010
140views more  JMLR 2010»
13 years 2 months ago
Mean Field Variational Approximation for Continuous-Time Bayesian Networks
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
Ido Cohn, Tal El-Hay, Nir Friedman, Raz Kupferman
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 2 months ago
Online Learning of Rested and Restless Bandits
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
Cem Tekin, Mingyan Liu