Sciweavers

477 search results - page 8 / 96
» Algorithms for dynamic geometric problems over data streams
Sort
View
SSDBM
2010
IEEE
181views Database» more  SSDBM 2010»
13 years 5 months ago
Stratified Reservoir Sampling over Heterogeneous Data Streams
Reservoir sampling is a well-known technique for random sampling over data streams. In many streaming applications, however, an input stream may be naturally heterogeneous, i.e., c...
Mohammed Al-Kateb, Byung Suk Lee
ESCAPE
2007
Springer
266views Algorithms» more  ESCAPE 2007»
14 years 1 months ago
CR-precis: A Deterministic Summary Structure for Update Data Streams
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
Sumit Ganguly, Anirban Majumder
DC
2008
13 years 7 months ago
Sketching asynchronous data streams over sliding windows
We study the problem of maintaining a sketch of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in wh...
Bojian Xu, Srikanta Tirthapura, Costas Busch
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
14 years 7 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
13 years 11 months ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
Hoang Thanh Lam, Toon Calders