Sciweavers

257 search results - page 39 / 52
» An Approximate L1-Difference Algorithm for Massive Data Stre...
Sort
View
85
Voted
ICPP
2008
IEEE
15 years 4 months ago
Fast Source Switching for Gossip-Based Peer-to-Peer Streaming
In this paper we consider gossip-based Peer-to-Peer streaming applications where multiple sources exist and they work serially. More specifically, we tackle the problem of fast s...
Zhenhua Li, Jiannong Cao, Guihai Chen, Yan Liu
PODS
2010
ACM
232views Database» more  PODS 2010»
15 years 2 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
EDBT
2009
ACM
119views Database» more  EDBT 2009»
15 years 26 days ago
Unrestricted wavelet synopses under maximum error bound
Constructing Haar wavelet synopses under a given approximation error has many real world applications. In this paper, we take a novel approach towards constructing unrestricted Ha...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
ESA
2003
Springer
96views Algorithms» more  ESA 2003»
15 years 2 months ago
Streaming Geometric Optimization Using Graphics Hardware
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
Pankaj K. Agarwal, Shankar Krishnan, Nabil H. Must...
APPROX
2011
Springer
197views Algorithms» more  APPROX 2011»
13 years 9 months ago
Periodicity and Cyclic Shifts via Linear Sketches
We consider the problem of identifying periodic trends in data streams. We say a signal a ∈ Rn is p-periodic if ai = ai+p for all i ∈ [n − p]. Recently, Erg¨un et al. [4] pr...
Michael S. Crouch, Andrew McGregor