34 search results - page 3 / 7 » Approximate Counts and Quantiles over Sliding Windows |
SIGMOD
2005
ACM
14 years 6 months ago
2005
ACM
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
ALGORITHMICA
2004
13 years 6 months ago
2004
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
KDD
2010
ACM
13 years 10 months ago
2010
ACM
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
PODS
2003
ACM
14 years 6 months ago
2003
ACM
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
ICDE
2008
IEEE
14 years 7 months ago
2008
IEEE
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...