Sciweavers

2775 search results - page 335 / 555
» Differencing Data Streams
Sort
View
SIGMOD
2005
ACM
119views Database» more  SIGMOD 2005»
15 years 11 months ago
Update-Pattern-Aware Modeling and Processing of Continuous Queries
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...
Lukasz Golab, M. Tamer Özsu
SOFSEM
2009
Springer
15 years 7 months ago
Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression
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...
Elvira Mayordomo, Philippe Moser
ICPR
2008
IEEE
15 years 5 months ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
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 ...
Alexander Kolesnikov
SODA
2004
ACM
173views Algorithms» more  SODA 2004»
15 years 6 days ago
Tabulation based 4-universal hashing with applications to second moment estimation
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...
Mikkel Thorup, Yin Zhang
JMLR
2010
154views more  JMLR 2010»
14 years 5 months ago
MOA: Massive Online Analysis
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...