3875 search results - page 573 / 775 » Approximation algorithms for the 0-extension problem |
155
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...
174
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...
272
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...
266
click to vote
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...
276
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...