23 search results - page 3 / 5 » The maximum hypervolume set yields near-optimal approximatio... |
CPM
2000
Springer
13 years 10 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
ALGOSENSORS
2007
Springer
13 years 12 months ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
INFOCOM
2012
IEEE
11 years 8 months ago
2012
IEEE
—In this work we develop a distributed boundary detection algorithm, dubbed Coconut, for 3D wireless sensor networks. It first constructs a tetrahedral structure to delineate th...
ISAAC
2009
Springer
14 years 9 days 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 ...
3DPVT
2006
IEEE
13 years 12 months ago
2006
IEEE
We present a systematic view planning method to assist construction of 3-D models of large outdoor sites using a mobile robot platform with mounted scanner. In the first stage, w...