Sciweavers

999 search results - page 154 / 200
» Warping the time on data streams
Sort
View
SIGCOMM
2009
ACM
14 years 2 months ago
Every microsecond counts: tracking fine-grain latencies with a lossy difference aggregator
Many network applications have stringent end-to-end latency requirements, including VoIP and interactive video conferencing, automated trading, and high-performance computing—wh...
Ramana Rao Kompella, Kirill Levchenko, Alex C. Sno...
APPROX
2011
Springer
197views Algorithms» more  APPROX 2011»
12 years 7 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
ADMA
2008
Springer
89views Data Mining» more  ADMA 2008»
13 years 9 months ago
Timeline Analysis of Web News Events
With a large number of news available on the internet everyday, it is an interesting work to automatically organize news events by time order and dependencies between events. The w...
Jiangtao Qiu, Chuan Li, Shaojie Qiao, Taiyong Li, ...
ICML
2008
IEEE
14 years 8 months ago
Modeling interleaved hidden processes
Hidden Markov models assume that observations in time series data stem from some hidden process that can be compactly represented as a Markov chain. We generalize this model by as...
Niels Landwehr
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting