scientific article; zbMATH DE number 2119721
From MaRDI portal
Publication:4828995
zbMATH Open1093.68673MaRDI QIDQ4828995FDOQ4828995
Authors: Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani 
Publication date: 29 November 2004
Title of this publication is not available (Why is that?)
Recommendations
Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Approximation algorithms (68W25)
Cited In (33)
- Linked-tree: An aggregate query algorithm based on sliding window over data stream
- Give me some slack: efficient network measurements
- Multivariate network traffic analysis using clustered patterns
- Fast and accurate mining of correlated heavy hitters
- Recent progress on selected topics in database research. -- A report by nine young Chinese researchers working in the United States.
- Optimal sampling from sliding windows
- Maintaining Stream Statistics over Sliding Windows
- Distributed streams algorithms for sliding windows
- Continuous monitoring of distributed data streams over a time-based sliding window
- Sketching asynchronous streams over a sliding window
- Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream
- Dynamically computing approximate frequency counts in sliding window over data stream
- A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
- Continuous Monitoring of Distributed Data Streams Over a Time-based Sliding Window
- Efficient pebbling for list traversal synopses with application to program rollback
- How to catch \(L_2\)-heavy-hitters on sliding windows
- Streaming techniques and data aggregation in networks of tiny artefacts
- Give me some slack: efficient network measurements
- Title not available (Why is that?)
- Title not available (Why is that?)
- Competitive analysis of maintaining frequent items of a stream
- Greedily computing associative aggregations on sliding windows
- Distributed mining of time-faded heavy hitters
- Zero-one laws for sliding windows and universal sketches
- Effective computations on sliding windows
- Brief announcement: Give me some slack: efficient network measurements
- Challenges in benchmarking stream learning algorithms with real-world data
- CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams
- The frequent items problem, under polynomial decay, in the streaming model
- Almost-smooth histograms and sliding-window graph algorithms
- Estimating the number of active flows in a data stream over a sliding window
- Approximate query processing over static sets and sliding windows
- Approximate query processing over static sets and sliding windows
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828995)
