The following pages link to (Q4737200):
Displaying 45 items.
- Mining frequent items in data stream using time fading model (Q498012) (← links)
- Fingerprints for highly similar streams (Q498399) (← links)
- CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams (Q506760) (← links)
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- Mining evolving data streams for frequent patterns (Q854217) (← links)
- Mining sequential patterns across time sequences (Q951304) (← links)
- Mining frequent closed itemsets from a landmark window over online data streams (Q971570) (← links)
- Deterministic \(k\)-set structure (Q975518) (← links)
- The frequent items problem, under polynomial decay, in the streaming model (Q986537) (← links)
- Sketching information divergences (Q1009269) (← links)
- Hierarchical sampling from sketches: Estimating functions over data streams (Q1016526) (← links)
- A general framework for never-ending learning from time series streams (Q1715913) (← links)
- Fast and accurate mining of correlated heavy hitters (Q1741373) (← links)
- A time optimized scheme for top-\( k\) list maintenance over incomplete data streams (Q1749630) (← 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)
- A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems (Q2245100) (← links)
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time (Q2252137) (← links)
- Binary vectors for fast distance and similarity estimation (Q2362826) (← links)
- Frequent Directions: Simple and Deterministic Matrix Sketching (Q2821796) (← links)
- Sparse Recovery with Partial Support Knowledge (Q3088079) (← links)
- Compressive Gaussian Mixture Estimation (Q3460835) (← links)
- A Phrase Recommendation Algorithm Based on Query Stream Mining in Web Search Engines (Q3520037) (← links)
- A Note on Estimating Hybrid Frequency Moment of Data Streams (Q3638451) (← links)
- (Q4969048) (← links)
- Space‐efficient tracking of persistent items in a massive data stream (Q4969927) (← links)
- Estimating Leverage Scores via Rank Revealing Methods and Randomization (Q5006452) (← links)
- Buffered Count-Min Sketch on SSD: Theory and Experiments (Q5009602) (← links)
- Optimal (Euclidean) Metric Compression (Q5080486) (← links)
- RidgeSketch: A Fast Sketching Based Solver for Large Scale Ridge Regression (Q5099418) (← links)
- Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory (Q5112239) (← links)
- On Approximating Matrix Norms in Data Streams (Q5244397) (← links)
- (Q5743471) (← links)
- Perfect $L_p$ Sampling in a Data Stream (Q5858643) (← links)
- Tracking the l_2 Norm with Constant Update Time (Q5875453) (← links)
- Towards Optimal Moment Estimation in Streaming and Distributed Models (Q5875483) (← links)
- Johnson–Lindenstrauss Embeddings with Kronecker Structure (Q5885797) (← links)
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. (Q6058197) (← links)
- Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space (Q6140352) (← links)
- Local differentially private frequency estimation based on learned sketches (Q6488769) (← links)
- Spiking neural networks through the lens of streaming algorithms (Q6535007) (← links)
- Randomized tensor wheel decomposition (Q6551213) (← links)
- Adversarially robust streaming algorithms via differential privacy (Q6551258) (← links)
- \texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores (Q6599985) (← links)
