60 search results - page 3 / 12 » k-Center Problems with Minimum Coverage |
ICRA
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract— In this paper, we formalize the problem of barrier coverage, that is, the problem of preventing undetected intrusion in a particular region using robot sensors. We solv...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
IJSNET
2008
13 years 5 months ago
2008
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— In this paper, we study the angle coverage problem in visual sensor networks where all sensors are equipped with cameras. An object of interest moves around the network and the...
TPDS
2008
13 years 5 months ago
2008
One of the key research issues in wireless sensor networks (WSNs) is how to efficiently deploy sensors to cover an area. In this paper, we solve the k-coverage sensor deployment pr...