135 search results - page 3 / 27 » Clustering Problems on Sliding Windows |
ALGORITHMICA
2004
13 years 9 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...
ACIIDS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We consider the problem of processing exact results for sliding window joins over data streams with limited memory. Existing approaches deal with memory limitations by shedding...
SIAMCOMP
2002
13 years 9 months ago
2002
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
KDD
2010
ACM
14 years 1 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...
ADC
2010
Springer
13 years 4 months ago
2010
Springer
Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real-time monitoring moving objects. In this paper, we ...