5595 search results - page 812 / 1119 » Approximation Algorithms for Clustering Problems |
185
click to vote
IPSN
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
157
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
180
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
278
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
272
Voted
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Consider a set of signals fs : {1, . . . , N} [0, . . . , M] appearing as a stream of tuples (i, fs(i)) in arbitrary order of i and s. We would like to devise one pass approximat...