Sciweavers

135 search results - page 4 / 27
» Clustering Problems on Sliding Windows
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 10 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
ICDM
2006
IEEE
227views Data Mining» more  ICDM 2006»
14 years 3 months ago
Incremental Mining of Sequential Patterns over a Stream Sliding Window
Incremental mining of sequential patterns from data streams is one of the most challenging problems in mining data streams. However, previous work of mining sequential patterns fr...
Chin-Chuan Ho, Hua-Fu Li, Fang-Fei Kuo, Suh-Yin Le...
PODS
2009
ACM
112views Database» more  PODS 2009»
14 years 10 months ago
Optimal sampling from sliding windows
APPEARED IN ACM PODS-2009. A sliding windows model is an important case of the streaming model, where only the most "recent" elements remain active and the rest are disc...
Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniol...
CVPR
2010
IEEE
14 years 6 months ago
Efficient Histogram-Based Sliding Window
Many computer vision problems rely on computing histogram-based objective functions with a sliding window. A main limiting factor is the high computational cost. Existing computat...
Yichen Wei, Litian Tao
STACS
2007
Springer
14 years 3 months ago
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
Costas Busch, Srikanta Tirthapura