Pages that link to "Item:Q1305928"
From MaRDI portal
The following pages link to The space complexity of approximating the frequency moments (Q1305928):
Displayed 50 items.
- Random projections for Bayesian regression (Q144017) (← links)
- Space-efficient estimation of statistics over sub-sampled streams (Q262266) (← links)
- Robust estimation of \(U\)-statistics (Q335650) (← links)
- Certifying equality with limited interaction (Q343864) (← links)
- Adapting parallel algorithms to the W-stream model, with applications to graph problems (Q410728) (← links)
- A note on randomized streaming space bounds for the longest increasing subsequence problem (Q413292) (← links)
- Estimating hybrid frequency moments of data streams (Q431931) (← links)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- Streaming techniques and data aggregation in networks of tiny artefacts (Q465668) (← links)
- Competitive analysis of maintaining frequent items of a stream (Q476837) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- Boosting distinct random sampling for basic counting on the union of distributed streams (Q497679) (← links)
- Fingerprints for highly similar streams (Q498399) (← links)
- Noise dependency of algorithms for calculating fractal dimensions in digital images (Q502926) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- Best-order streaming model (Q534570) (← links)
- Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable (Q538463) (← links)
- Partition arguments in multiparty communication complexity (Q541668) (← links)
- Stochastic convergence of random search methods to fixed size Pareto front approximations (Q545118) (← links)
- An information statistics approach to data stream and communication complexity (Q598248) (← links)
- Statistical estimation with bounded memory (Q693352) (← links)
- Tracking join and self-join sizes in limited storage (Q696969) (← links)
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- Tradeoff lower lounds for stack machines (Q744614) (← links)
- A general method for estimating correlated aggregates over a data stream (Q747615) (← links)
- A note on efficient aggregate queries in sensor networks (Q868957) (← links)
- Empirical risk minimization for heavy-tailed losses (Q892246) (← links)
- Deterministic \(k\)-set structure (Q975518) (← links)
- A note on compressed sensing and the complexity of matrix multiplication (Q987795) (← links)
- Two improved range-efficient algorithms for \(F_0\) estimation (Q1007249) (← links)
- Sketching information divergences (Q1009269) (← links)
- Hierarchical sampling from sketches: Estimating functions over data streams (Q1016526) (← links)
- Multiple pass streaming algorithms for learning mixtures of distributions in \(\mathbb R^d\) (Q1017656) (← links)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- Know when to persist: deriving value from a stream buffer (Q1704857) (← links)
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- Sub-Gaussian estimators of the mean of a random vector (Q1731055) (← links)
- Streaming pattern matching with \(d\) wildcards (Q1741859) (← links)
- On finding common neighborhoods in massive graphs. (Q1874417) (← links)
- Finding frequent items in data streams (Q1884870) (← links)
- Optimal tracking of distributed heavy hitters and quantiles (Q1939670) (← links)
- Learning from MOM's principles: Le Cam's approach (Q2010482) (← links)
- A MOM-based ensemble method for robustness, subsampling and hyperparameter tuning (Q2044333) (← links)
- Robust \(k\)-means clustering for distributions with two moments (Q2054489) (← links)
- Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
- K-bMOM: A robust Lloyd-type clustering algorithm based on bootstrap median-of-means (Q2072412) (← links)
- Finite sample properties of parametric MMD estimation: robustness to misspecification and dependence (Q2073208) (← links)
- An estimator for matching size in low arboricity graphs with two applications (Q2106871) (← links)
- Distribution-free robust linear regression (Q2113267) (← links)
- On the streaming indistinguishability of a random permutation and a random function (Q2119020) (← links)