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.
- 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)
- Robust sub-Gaussian estimation of a mean vector in nearly linear time (Q2119240) (← links)
- Concentration of the collision estimator (Q2140524) (← links)
- Optimal robust mean and location estimation via convex programs with respect to any pseudo-norms (Q2159256) (← links)
- Streaming algorithms for multitasking scheduling with shared processing (Q2166248) (← links)
- Robust statistical learning with Lipschitz and convex loss functions (Q2174664) (← links)
- Robust machine learning by median-of-means: theory and practice (Q2196199) (← links)
- Mean estimation with sub-Gaussian rates in polynomial time (Q2196216) (← links)
- Robust classification via MOM minimization (Q2203337) (← links)
- Challenges in benchmarking stream learning algorithms with real-world data (Q2212534) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Applying approximate counting for computing the frequency moments of long data streams (Q2272207) (← links)
- Database query processing using finite cursor machines (Q2272221) (← links)
- The breakdown point of the median of means tournament (Q2322677) (← links)
- Mean estimation and regression under heavy-tailed distributions: A survey (Q2329044) (← links)
- Near-optimal mean estimators with respect to general norms (Q2334371) (← links)
- Streaming algorithms for extent problems in high dimensions (Q2345940) (← links)
- Counting distinct items over update streams (Q2371800) (← links)
- Tight lower bounds for query processing on streaming and external memory data (Q2373746) (← links)
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
- Query-monotonic Turing reductions (Q2383592) (← links)
- Sublinear algorithms for approximating string compressibility (Q2392931) (← links)
- Improved algorithms for distributed entropy monitoring (Q2408102) (← links)
- Continuous monitoring of distributed data streams over a time-based sliding window (Q2428698) (← links)
- On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
- Optimal collapsing protocol for multiparty pointer jumping (Q2441545) (← links)
- An efficient FPRAS type group testing procedure to approximate the number of defectives (Q2444143) (← links)
- Adaptive sampling for geometric problems over data streams (Q2477195) (← links)
- The communication requirements of efficient allocations and supporting prices (Q2496786) (← links)