Sciweavers

606 search results - page 25 / 122
» Memory-constrained aggregate computation over data streams
Sort
View
ICTCS
2005
Springer
14 years 8 days ago
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
Tsvi Kopelowitz, Ely Porat
PODS
2006
ACM
108views Database» more  PODS 2006»
14 years 6 months ago
Deterministic k-set structure
A k-set structure over data streams is a bounded-space data structure that supports stream insertion and deletion operations and returns the set of (item, frequency) pairs in the s...
Sumit Ganguly, Anirban Majumder
TJS
2002
128views more  TJS 2002»
13 years 6 months ago
Packet Spacing: An Enabling Mechanism for Delivering Multimedia Content in Computational Grids
Streaming multimedia with UDP has become increasingly popular over distributed systems like the Internet. Scientific applications that stream multimedia include remote computation...
Annette C. Feng, Apu Kapadia, Wu-chun Feng, Geneva...
EDBT
2008
ACM
206views Database» more  EDBT 2008»
14 years 6 months ago
Designing an inductive data stream management system: the stream mill experience
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo
TKDE
2008
155views more  TKDE 2008»
13 years 6 months ago
Incremental Maintenance of Online Summaries Over Multiple Streams
We propose a novel approach based on predictive quantization (PQ) for online summarization of multiple time-varying data streams. A synopsis over a sliding window of most recent en...
Fatih Altiparmak, Ertem Tuncel, Hakan Ferhatosmano...