Sciweavers

128 search results - page 13 / 26
» Sketching probabilistic data streams
Sort
View
ICDE
2007
IEEE
161views Database» more  ICDE 2007»
14 years 1 months ago
How to scalably and accurately skip past streams
Data stream methods look at each new item of the stream, perform a small number of operations while keeping a small amount of memory, and still perform muchneeded analyses. Howeve...
Supratik Bhattacharyya, André Madeira, S. M...
PODS
2005
ACM
131views Database» more  PODS 2005»
14 years 7 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
COMPGEOM
2004
ACM
14 years 27 days ago
Deterministic sampling and range counting in geometric data streams
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
Amitabha Bagchi, Amitabh Chaudhary, David Eppstein...
EDBT
2008
ACM
99views Database» more  EDBT 2008»
14 years 7 months ago
Querying time-series streams
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
Vivekanand Gopalkrishnan
INFOCOM
2006
IEEE
14 years 1 months ago
Reverse Hashing for High-Speed Network Monitoring: Algorithms, Evaluation, and Applications
— A key function for network traffic monitoring and analysis is the ability to perform aggregate queries over multiple data streams. Change detection is an important primitive w...
Robert T. Schweller, Zhichun Li, Yan Chen, Yan Gao...