1433 search results - page 119 / 287 » On Covering Problems of Rado |
149
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
203
click to vote
SPAA
1993
ACM
15 years 10 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...
209
click to vote
ALGOSENSORS
2007
Springer
15 years 10 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...
168
click to vote
CDC
2008
IEEE
15 years 8 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...
161
click to vote
CSDA
2007
15 years 6 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...