Sciweavers

156 search results - page 10 / 32
» Decomposing Coverings and the Planar Sensor Cover Problem
Sort
View
COMCOM
2006
150views more  COMCOM 2006»
13 years 7 months ago
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Wireless sensor networks constitute the platform of a broad range of applications related to national security, surveillance, military, health care, and environmental monitoring. ...
Mihaela Cardei, Jie Wu
AUTOMATICA
2006
140views more  AUTOMATICA 2006»
13 years 7 months ago
On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
Vijay Gupta, Timothy H. Chung, Babak Hassibi, Rich...
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
PETRA
2009
ACM
14 years 2 months ago
Automatic sensor placement in a 3D volume
Given a 3D environment, a set of constraints, and a set of sensor models, this paper addresses the problem of finding the set of sensors and their corresponding placement that cov...
Eric Becker, Gutemberg Guerra-Filho, Fillia Makedo...
AINA
2006
IEEE
14 years 1 months ago
Clustering Protocol for Sensor Networks
In this paper we present Clustering Protocol (CP) for sensor networks. Clustering techniques are used by different protocols and applications to increase scalability and reduce de...
Arjan Durresi, Vamsi Paruchuri, Leonard Barolli