1424 search results - page 109 / 285 » The Multi-radius Cover Problem |
145
click to vote
SPAA
1993
ACM
15 years 7 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
160
Voted
ALGOSENSORS
2007
Springer
15 years 7 months ago
2007
Springer
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
133
click to vote
CDC
2008
IEEE
15 years 5 months ago
2008
IEEE
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...
111
Voted
CSDA
2007
15 years 3 months ago
2007
Multiple pairwise comparisons are one of the most frequent tasks in applied statistics. In this context, letter displays may be used for a compact presentation of results of multi...
138
Voted
JNSM
2008
15 years 3 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...