Sciweavers

2254 search results - page 148 / 451
» Computing the minimal covering set
Sort
View
ICDCS
2006
IEEE
16 years 19 days ago
Self-Protection for Wireless Sensor Networks
Wireless sensor networks have recently been suggested for many surveillance applications such as object monitoring, path protection, or area coverage. Since the sensors themselves...
Dan Wang, Qian Zhang, Jiangchuan Liu
AINA
2010
IEEE
15 years 11 months ago
Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks
— We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need ...
Khaled Almiani, Anastasios Viglas, Lavy Libman
SGAI
2010
Springer
15 years 1 months ago
A Structural Approach to Sensor Placement based on Symbolic Compilation of the Model
: In the present paper we address the problem of computing the Minimal Additional Sensor Sets (MASS) that guarantee a desired level of diagnostic discrimination for a system. Recen...
Gianluca Torta, Pietro Torasso
ICML
2004
IEEE
16 years 7 months ago
Decentralized detection and classification using kernel methods
We consider the problem of decentralized detection under constraints on the number of bits that can be transmitted by each sensor. In contrast to most previous work, in which the ...
XuanLong Nguyen, Martin J. Wainwright, Michael I. ...
DCC
2006
IEEE
16 years 6 months ago
Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions
Lossless compression is studied for pairs of independent integer-valued symbols emitted by a source with a geometric probability distribution of parameter q (0, 1). Optimal prefix...
Alfredo Viola, Frédérique Bassino, G...