Pages that link to "Item:Q4675489"
From MaRDI portal
The following pages link to An improved data stream summary: the count-min sketch and its applications (Q4675489):
Displayed 50 items.
- Space-efficient estimation of statistics over sub-sampled streams (Q262266) (← links)
- Loda: lightweight on-line detector of anomalies (Q298359) (← links)
- Mining frequent itemsets over distributed data streams by continuously maintaining a global synopsis (Q408650) (← links)
- Estimating hybrid frequency moments of data streams (Q431931) (← links)
- Streaming techniques and data aggregation in networks of tiny artefacts (Q465668) (← links)
- Voting almost maximizes social welfare despite limited communication (Q646516) (← links)
- Optimizing the confidence bound of count-min sketches to estimate the streaming big data query results more precisely (Q783053) (← links)
- Sketched learning for image denoising (Q826190) (← links)
- Deterministic \(k\)-set structure (Q975518) (← links)
- The frequent items problem, under polynomial decay, in the streaming model (Q986537) (← links)
- Finding frequent items over sliding windows with constant update time (Q991773) (← links)
- Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery (Q1006638) (← links)
- Sketching information divergences (Q1009269) (← links)
- Hierarchical sampling from sketches: Estimating functions over data streams (Q1016526) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- Expander \(\ell_0\)-decoding (Q1669068) (← links)
- Identifying correlated heavy-hitters in a two-dimensional data stream (Q1741250) (← links)
- Fast and accurate mining of correlated heavy hitters (Q1741373) (← links)
- A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution (Q1750526) (← links)
- Distributed mining of time-faded heavy hitters (Q2054052) (← links)
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy (Q2056803) (← links)
- Top-\(k\) frequent items and item frequency tracking over sliding windows of any size (Q2201636) (← links)
- Labeled graph sketches: keeping up with real-time graph streams (Q2224937) (← links)
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time (Q2252137) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Improved algorithms for distributed entropy monitoring (Q2408102) (← links)
- On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
- Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks (Q2471714) (← links)
- Compressive statistical learning with random feature moments (Q2664824) (← links)
- Frugal Streaming for Estimating Quantiles (Q2848969) (← links)
- A Statistical Analysis of Probabilistic Counting Algorithms (Q2911701) (← links)
- Indexing for summary queries (Q2943560) (← links)
- Range Majority in Constant Time and Linear Space (Q3012810) (← links)
- Compressed sensing and best 𝑘-term approximation (Q3079195) (← links)
- Periodicity and Cyclic Shifts via Linear Sketches (Q3088091) (← links)
- Streaming Algorithms with One-Sided Estimation (Q3088116) (← links)
- Evaluating Bayesian Networks via Data Streams (Q3196429) (← links)
- Simplified Planar Coresets for Data Streams (Q3512444) (← links)
- A Note on Estimating Hybrid Frequency Moment of Data Streams (Q3638451) (← links)
- A framework for clustering massive graph streams (Q4969739) (← links)
- Space‐efficient tracking of persistent items in a massive data stream (Q4969927) (← links)
- Multiscale Matrix Sampling and Sublinear-Time PageRank Computation (Q4985347) (← links)
- An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems (Q4997835) (← links)
- (Q4998869) (← links)
- Sublinear Algorithms for MAXCUT and Correlation Clustering (Q5002682) (← links)
- Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. (Q5009499) (← links)
- Deterministic Heavy Hitters with Sublinear Query Time (Q5009510) (← links)
- On Low-Risk Heavy Hitters and Sparse Recovery Schemes (Q5009511) (← links)
- Buffered Count-Min Sketch on SSD: Theory and Experiments (Q5009602) (← links)
- Compressive Learning for Patch-Based Image Denoising (Q5043726) (← links)