2496 search results - page 174 / 500 » On covering by translates of a set |
178
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
We study the following geometric hypergraph coloring problem: given a planar point set and an integer k, we wish to color the points with k colors so that any axis-aligned strip co...
171
click to vote
INFOCOM
2007
IEEE
16 years 26 days ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
183
click to vote
COCOON
2005
Springer
16 years 3 days ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
173
click to vote
ISTCS
1993
Springer
15 years 10 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
181
click to vote
JNSM
2008
15 years 6 months ago
2008
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...