Sciweavers

52 search results - page 11 / 11
» Approximating sensor network queries using in-network summar...
Sort
View
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 6 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 5 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
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...
Abhimanyu Das, David Kempe