scientific article; zbMATH DE number 2086663
From MaRDI portal
Publication:4737200
Recommendations
Cited in
(66)- Sketching information divergences
- Hierarchical sampling from sketches: Estimating functions over data streams
- A general framework for never-ending learning from time series streams
- Fast and accurate mining of correlated heavy hitters
- A time optimized scheme for top-\( k\) list maintenance over incomplete data streams
- A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution
- Finding frequent items in data streams
- Distributed mining of time-faded heavy hitters
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
- A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
- Binary vectors for fast distance and similarity estimation
- Frequent directions: simple and deterministic matrix sketching
- Competitive Analysis of Maintaining Frequent Items of a Stream
- Sparse recovery with partial support knowledge
- Study of a discovery method for useful data items in distributed data streams
- Compressive Gaussian mixture estimation
- Finding Frequent Items in a Turnstile Data Stream
- A Phrase Recommendation Algorithm Based on Query Stream Mining in Web Search Engines
- Finding Frequent Elements in Non-bursty Streams
- On Finding Frequent Elements in a Data Stream
- An efficient algorithm for mining approximate frequent item over data streams
- A Note on Estimating Hybrid Frequency Moment of Data Streams
- Identifying frequent items in distributed data sets
- Practical locally private heavy hitters
- Space‐efficient tracking of persistent items in a massive data stream
- Mining frequent items in data stream using time fading model
- Fingerprints for highly similar streams
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- Buffered Count-Min Sketch on SSD: Theory and Experiments
- CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams
- Optimal (Euclidean) Metric Compression
- RidgeSketch: a fast sketching based solver for large scale ridge regression
- Stochastic reformulations of linear systems: algorithms and convergence theory
- On approximating matrix norms in data streams
- Database Theory - ICDT 2005
- Sublinear time, measurement-optimal, sparse recovery for all
- Perfect \(L_p\) sampling in a data stream
- Tracking the l₂ Norm with Constant Update Time
- Towards Optimal Moment Estimation in Streaming and Distributed Models
- Johnson–Lindenstrauss Embeddings with Kronecker Structure
- Towards Optimal Moment Estimation in Streaming and Distributed Models
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.
- Randomized counter-based algorithms for frequency estimation over data streams in O( N) space
- Local differentially private frequency estimation based on learned sketches
- Streaming Euclidean MST to a constant factor
- What's hot and what's not: tracking most frequent items dynamically
- Spiking neural networks through the lens of streaming algorithms
- Randomized tensor wheel decomposition
- Adversarially robust streaming algorithms via differential privacy
- \texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores
- Daisy Bloom filters
- Analysis of randomized Householder-Cholesky QR factorization with multisketching
- A count column sketch method for tensor auto-regression parameter estimation
- Exploiting pseudo-locality of interchange distance
- Near-optimal two-pass streaming algorithm for sampling random walks over directed graphs
- Matchings in low-arboricity graphs in the dynamic graph stream model
- On the adaptively inexact sketched Newton-Raphson methods for nonlinear systems of equations
- A class of improved randomized Gauss-Seidel methods based on the leverage scores for the parameter estimation of TAR model
- Tight bounds for heavy-hitters and moment estimation in the sliding window model
- How to catch \(L_2\)-heavy-hitters on sliding windows
- Mining evolving data streams for frequent patterns
- Mining sequential patterns across time sequences
- Mining frequent closed itemsets from a landmark window over online data streams
- Deterministic \(k\)-set structure
- The frequent items problem, under polynomial decay, in the streaming model
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 Q4737200)
