A defining characteristic of continuous queries over on-line data streams, possibly bounded by sliding windows, is the potentially infinite and time-evolving nature of their input...
This paper considers online compression algorithms that use at most polylogarithmic space (plogon). These algorithms correspond to compressors in the data stream model. We study th...
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
We show that 4-universal hashing can be implemented efficiently using tabulated 4-universal hashing for characters, gaining a factor of 5 in speed over the fastest existing method...
Massive Online Analysis (MOA) is a software environment for implementing algorithms and running experiments for online learning from evolving data streams. MOA includes a collecti...
Albert Bifet, Geoff Holmes, Richard Kirkby, Bernha...