Sciweavers

70 search results - page 1 / 14
» Robust sensor placements at informative and communication-ef...
Sort
View
TOSN
2011
65views more  TOSN 2011»
13 years 8 days ago
Robust sensor placements at informative and communication-efficient locations
Andreas Krause, Carlos Guestrin, Anupam Gupta, Jon...
JMLR
2008
159views more  JMLR 2008»
13 years 5 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
GLOBECOM
2007
IEEE
13 years 11 months ago
A Steepest Descent Relocation Algorithm for Placement of Sinks in a Sensor Network
— In this paper we use an information flow model for placement of traffic sinks in a wireless sensor network. Our mathematical model translates a communication network composed...
Mehdi Kalantari, Mark A. Shayman
CDC
2009
IEEE
132views Control Systems» more  CDC 2009»
13 years 10 months ago
Optimal sensor placement for time difference of arrival localization
— This paper addresses the problem of localizing a source from noisy time-of-arrival measurements. In particular, we are interested in the optimal placement of M planar sensors s...
Jason T. Isaacs, Daniel J. Klein, João Pedr...
EJC
2008
13 years 3 months ago
Locating sensors in paths and cycles: The case of 2-identifying codes
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
David L. Roberts, Fred S. Roberts