256 search results - page 16 / 52 » Approximation Algorithms for Hamming Clustering Problems |
105
click to vote
DAGSTUHL
2007
15 years 4 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
227
click to vote
PODS
2009
ACM
16 years 3 months ago
2009
ACM
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
111
Voted
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
144
click to vote
IAT
2009
IEEE
15 years 9 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
113
click to vote
ADHOC
2010
15 years 3 months ago
2010
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...