955 search results - page 12 / 191 » Cover Set Problem in Directional Sensor Networks |
ICC
2007
IEEE
15 years 3 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...
113
click to vote
COCOON
2004
Springer
15 years 3 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
JCO
2010
14 years 8 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— 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...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...