Sciweavers

242 search results - page 26 / 49
» Approximately uniform random sampling in sensor networks
Sort
View
140
Voted
AVSS
2006
IEEE
15 years 10 months ago
Large System Decision Fusion Performance in Inhomogeneous Sensor Networks
The problem of decision fusion in a large wireless sensor system with many power-constrained distributed nodes is considered. The sensor network is assumed to be inhomogeneous. i....
Sudharman K. Jayaweera, Kossai Al-Tarazi
TWC
2010
14 years 10 months ago
Impact of mobile node density on detection performance measures in a hybrid sensor network
We investigate the impact of mobile node density on several detection performance measures for stationary target detection by a hybrid sensor network consisting of both static and ...
Thakshila Wimalajeewa, Sudharman K. Jayaweera
140
Voted
IPSN
2004
Springer
15 years 9 months ago
Estimation from lossy sensor data: jump linear modeling and Kalman filtering
Due to constraints in cost, power, and communication, losses often arise in large sensor networks. The sensor can be modeled as an output of a linear stochastic system with random...
Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal
139
Voted
IPSN
2009
Springer
15 years 10 months ago
Simultaneous placement and scheduling of sensors
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlo...
124
Voted
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
16 years 4 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan