Pages that link to "Item:Q1305928"
From MaRDI portal
The following pages link to The space complexity of approximating the frequency moments (Q1305928):
Displaying 50 items.
- 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)
- Finding longest increasing and common subsequences in streaming data (Q2498982) (← links)
- On graph problems in a semi-streaming model (Q2581265) (← links)
- Symmetric norm estimation and regression on sliding windows (Q2695322) (← links)
- Lower bounds for number-in-hand multiparty communication complexity, made easy (Q2796207) (← links)
- Know When to Persist: Deriving Value from a Stream Buffer (Q2830062) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- A statistical analysis of probabilistic counting algorithms (Q2911701) (← links)
- Indexing for summary queries (Q2943560) (← links)
- A contact detection algorithm for multi-sphere particles by means of two-level-grid-searching in DEM simulations (Q2952755) (← links)
- Periodicity and Cyclic Shifts via Linear Sketches (Q3088091) (← links)
- Almost Optimal Explicit Johnson-Lindenstrauss Families (Q3088132) (← links)
- Testing properties of collections of distributions (Q3191576) (← links)
- Automata theory on sliding windows (Q3304130) (← links)
- The Andoni–Krauthgamer–Razenshteyn Characterization of Sketchable Norms Fails for Sketchable Metrics (Q3384132) (← links)
- Taylor Polynomial Estimator for Estimating Frequency Moments (Q3448814) (← links)
- The Simultaneous Communication of Disjointness with Applications to Data Streams (Q3448862) (← links)
- Randomized OBDD-Based Graph Algorithms (Q3460720) (← links)
- Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$ (Q3520061) (← links)
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS (Q3521590) (← links)
- Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression (Q3599110) (← links)
- A Note on Estimating Hybrid Frequency Moment of Data Streams (Q3638451) (← links)
