2740 search results - page 271 / 548 » Approximating Component Selection |
126
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
135
Voted
DSN
2008
IEEE
15 years 10 months ago
2008
IEEE
Temporal locality in workloads creates conditions in which a server, in order to remain available, should quickly process bursts of requests with large service requirements. In th...
130
Voted
INFOCOM
2007
IEEE
15 years 10 months 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...
113
click to vote
PG
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
111
click to vote
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— This work addresses the capability to use concentration gridmaps to locate a static gas source. In previous works it was found that depending on the shape of the mapped...