scientific article; zbMATH DE number 1256715
From MaRDI portal
Publication:4228450
Recommendations
Cited in
(75)- Geometric median and robust estimation in Banach spaces
- The space complexity of approximating the frequency moments
- New bounds for the CLIQUE-GAP problem using graph decomposition theory
- Summarizing numeric spatial data streams by trend cluster discovery
- Dynamic graph stream algorithms in \(o(n)\) space
- Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries
- Solvable integration problems and optimal sample size selection
- Nearly optimal robust mean estimation via empirical characteristic function
- Near-optimal clustering in the \(k\)-machine model
- Robust and efficient mean estimation: an approach based on the properties of self-normalized sums
- Property-preserving hash functions for Hamming distance from standard assumptions
- Applying approximate counting for computing the frequency moments of long data streams
- Give me some slack: efficient network measurements
- Robust modifications of U-statistics and applications to covariance estimation problems
- Distributed statistical estimation and rates of convergence in normal approximation
- Optimal confidence for Monte Carlo integration of smooth functions
- Arthur-Merlin streaming complexity
- Counting distinct items over update streams
- Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
- Using invariants to change detection in dynamical system with chaos
- Regular Programming for Quantitative Properties of Data Streams
- New bounds for the CLIQUE-GAP problem using graph decomposition theory
- A randomized algorithm for finding frequent elements in streams using O( N) space
- The cost of fault tolerance in multi-party communication complexity
- Fast sketch-based recovery of correlation outliers
- Linked-tree: An aggregate query algorithm based on sliding window over data stream
- Streaming algorithms for language recognition problems
- Optimal sampling from sliding windows
- Robust and scalable Bayes via a median of subset posterior measures
- scientific article; zbMATH DE number 6866300 (Why is no real title available?)
- Tight bounds for single-pass streaming complexity of the set cover problem
- Revisiting frequency moment estimation in random order streams
- Lower bounds for approximating graph parameters via communication complexity
- On sketching the \(q\) to \(p\) norms
- Adversarially robust property-preserving hash functions
- Large-scale distributed algorithms for facility location with outliers
- Querying a Matrix Through Matrix-Vector Products.
- Streaming low-rank matrix approximation with an application to scientific simulation
- The online space complexity of probabilistic languages
- In-network estimation of frequency moments
- Uniformity of point samples in metric spaces using gap ratio
- Tracking the l₂ Norm with Constant Update Time
- Towards Optimal Moment Estimation in Streaming and Distributed Models
- Approximate set union via approximate randomization
- Towards Optimal Moment Estimation in Streaming and Distributed Models
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.
- Arithmetic sketching
- A fast output-sensitive algorithm for Boolean matrix multiplication
- Sleeping on the job: energy-efficient and robust broadcast for radio networks
- Streaming Euclidean MST to a constant factor
- (Noisy) gap cycle counting strikes back: random order streaming lower bounds for connected components and beyond
- The geometric median and applications to robust mean estimation
- Range (Rényi) entropy queries and partitioning
- Bit-array-based alternatives to HyperLogLog
- Space-optimal profile estimation in data streams with applications to symmetric functions
- Uniform bounds for robust mean estimators
- Bit-array-based alternatives to HyperLogLog
- Additive noise mechanisms for making randomized approximation algorithms differentially private
- Geometric covering using random fields
- On deviation probabilities in non-parametric regression with heavy-tailed noise
- Cardinality estimation using Gumbel distribution
- Efficient differentially private F₀ linear sketching
- Nonasymptotic heavy-tailed mean estimation in smooth Banach spaces
- k-submodular maximization under individual knapsack constraints: applications and streaming algorithm
- Optimal nonparametric estimation of the expected shortfall risk
- Weighted matching in a poly-streaming model
- Sublinear space graph algorithms in the continual release model
- Local computation algorithms for knapsack: impossibility results, and how to avoid them
- Tight bounds for heavy-hitters and moment estimation in the sliding window model
- Streaming maximal matching with bounded deletions
- Fast estimation of fractal dimension and correlation integral on stream data
- On-board vehicle data stream monitoring using mine-fleet and fast resource constrained monitoring of correlation matrices
- The price of validity in dynamic networks
- Efficient transformations for Klee's measure problem in the streaming model
- Using invariants to determine change detection in dynamical system with chaos
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228450)
