2137 search results - page 219 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
159
click to vote
ALGOSENSORS
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
196
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
160
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
182
click to vote
DIALM
2004
ACM
15 years 12 months ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
184
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...