Sciweavers

1040 search results - page 25 / 208
» TCAM-conscious Algorithms for Data Streams
Sort
View
KDD
2003
ACM
194views Data Mining» more  KDD 2003»
14 years 8 months ago
Finding recent frequent itemsets adaptively over online data streams
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...
Joong Hyuk Chang, Won Suk Lee
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
14 years 8 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
FSTTCS
2005
Springer
14 years 1 months ago
Practical Algorithms for Tracking Database Join Sizes
We present novel algorithms for estimating the size of the natural join of two data streams that have efficient update processing times and provide excellent quality of estimates....
Sumit Ganguly, Deepanjan Kesh, Chandan Saha
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
14 years 8 months ago
Systematic data selection to mine concept-drifting data streams
One major problem of existing methods to mine data streams is that it makes ad hoc choices to combine most recent data with some amount of old data to search the new hypothesis. T...
Wei Fan
STACS
2007
Springer
14 years 1 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