2757 search results - page 52 / 552 » Deplump for Streaming Data |
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
SAC
2010
ACM
15 years 2 months ago
2010
ACM
We consider the problem of anomaly detection in multiple co-evolving data streams. In this paper, we introduce FRAHST (Fast Rank-Adaptive row-Householder Subspace Tracking). It au...
182
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
In a massive stream of sequential events such as stock feeds, sensor readings, or IP traffic measurements, tuples pertaining to recent events are typically more important than olde...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed dat...
104
click to vote
ASIACRYPT
2000
Springer
15 years 1 months ago
2000
Springer
In 1980 Hellman introduced a general technique for breaking arbitrary block ciphers with N possible keys in time T and memory M related by the tradeoff curve TM2 = N2 for 1 T N. ...