1566 search results - page 138 / 314 » On a Cone Covering Problem |
135
click to vote
LATIN
2010
Springer
15 years 11 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...
119
click to vote
GECCO
2009
Springer
15 years 9 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...
162
click to vote
SPAA
1993
ACM
15 years 8 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...
173
click to vote
ALGOSENSORS
2007
Springer
15 years 8 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...
140
click to vote
CDC
2008
IEEE
15 years 6 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...