Sciweavers

68 search results - page 3 / 14
» Lower Bounds for Noisy Wireless Networks using Sampling Algo...
Sort
View
CDC
2009
IEEE
13 years 9 months ago
On the queue-overflow probabilities of distributed scheduling algorithms
Abstract-- In this paper, we are interested in using largedeviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless sch...
Can Zhao, Xiaojun Lin
COLT
2010
Springer
13 years 3 months ago
Nonparametric Bandits with Covariates
We consider a bandit problem which involves sequential sampling from two populations (arms). Each arm produces a noisy reward realization which depends on an observable random cov...
Philippe Rigollet, Assaf Zeevi
ICASSP
2010
IEEE
13 years 6 months ago
Energy efficient lossy transmission over sensor networks with feedback
The energy-distortion function (E(D)) for a network is defined as the minimum total energy required to achieve a target distortion D at the receiver without putting any restricti...
Aman Jain, Deniz Gündüz, Sanjeev R. Kulk...
PERCOM
2008
ACM
14 years 5 months ago
An Algorithm for Distributed Beacon Selection
This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization ...
Dominik Lieckfeldt, Jiaxi You, Dirk Timmermann
CDC
2008
IEEE
149views Control Systems» more  CDC 2008»
13 years 7 months ago
Distributed computation under bit constraints
Abstract-- A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate...
Ola Ayaso, Devavrat Shah, Munther A. Dahleh