Pages that link to "Item:Q1884870"

The following pages link to Finding frequent items in data streams (Q1884870):

Displaying 36 items.

• Space-efficient estimation of statistics over sub-sampled streams (Q262266) (← links)
• Estimating hybrid frequency moments of data streams (Q431931) (← links)
• Identifying frequent items in distributed data sets (Q488300) (← links)
• Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
• Voting almost maximizes social welfare despite limited communication (Q646516) (← links)
• A general method for estimating correlated aggregates over a data stream (Q747615) (← links)
• Identifying correlated heavy-hitters in a two-dimensional data stream (Q1741250) (← links)
• Fast randomized matrix and tensor interpolative decomposition using countsketch (Q2025436) (← links)
• A fast sketching-based algorithm for rank-\((L,L,1)\) block term decomposition (Q2161453) (← links)
• On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
• Finding longest increasing and common subsequences in streaming data (Q2498982) (← links)
• Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← links)
• Taylor Polynomial Estimator for Estimating Frequency Moments (Q3448814) (← links)
• (Q4558555) (← links)
• Faster Kernel Ridge Regression Using Sketching and Preconditioning (Q4588937) (← links)
• Space‐efficient tracking of persistent items in a massive data stream (Q4969927) (← links)
• High Probability Frequency Moment Sketches (Q5002734) (← links)
• Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. (Q5009499) (← links)
• On Low-Risk Heavy Hitters and Sparse Recovery Schemes (Q5009511) (← links)
• Tight Bounds for the Subspace Sketch Problem with Applications (Q5009789) (← links)
• Tensor-Structured Sketching for Constrained Least Squares (Q5021024) (← links)
• ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
• A Framework for Adversarially Robust Streaming Algorithms (Q5066953) (← links)
• Near-Linear Time Local Polynomial Nonparametric Estimation with Box Kernels (Q5084601) (← links)
• (Q5090388) (← links)
• Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. (Q5240430) (← links)
• On Approximating Matrix Norms in Data Streams (Q5244397) (← links)
• Sketching for Principal Component Regression (Q5380270) (← links)
• Modeling support changes in streaming item sets (Q5426624) (← links)
• (Q5743469) (← links)
• Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares (Q5857850) (← links)
• Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
• Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations (Q6064026) (← links)
• Unbiased estimation of inner product via higher order count sketch (Q6072197) (← links)
• Stochastic linear regularization methods: random discrepancy principle and applications (Q6136777) (← links)
• Forty years of frequent items (Q6198649) (← links)