2714 search results - page 507 / 543 » Approximation Schemes for Scheduling |
93
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—Coverage is a fundamental problem in Wireless Sensor Networks (WSNs). Existing studies on this topic focus on 2D ideal plane coverage and 3D full space coverage. In many real wo...
111
Voted
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
105
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
ICRA
2008
IEEE
15 years 7 months ago
2008
IEEE
— Recent years have seen an explosion of research on the computational modeling of human visual attention in task free conditions, i.e., given an image predict where humans are l...
115
Voted
IPPS
2008
IEEE
15 years 7 months ago
2008
IEEE
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...