scientific article; zbMATH DE number 1256715
From MaRDI portal
Publication:4228450
zbMath0922.68057MaRDI QIDQ4228450
Mario Szegedy, Yossi Matias, Noga Alon
Publication date: 4 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Theory of data (68P99) Randomized algorithms (68W20)
Related Items (51)
The Online Space Complexity of Probabilistic Languages ⋮ Uniformity of Point Samples in Metric Spaces Using Gap Ratio ⋮ Linked-tree: An aggregate query algorithm based on sliding window over data stream ⋮ Fast estimation of fractal dimension and correlation integral on stream data ⋮ Counting distinct items over update streams ⋮ Unnamed Item ⋮ The Cost of Fault Tolerance in Multi-Party Communication Complexity ⋮ On-board vehicle data stream monitoring using mine-fleet and fast resource constrained monitoring of correlation matrices ⋮ Property-preserving hash functions for Hamming distance from standard assumptions ⋮ Towards Optimal Moment Estimation in Streaming and Distributed Models ⋮ The price of validity in dynamic networks ⋮ New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory ⋮ Streaming algorithms for language recognition problems ⋮ Towards Optimal Moment Estimation in Streaming and Distributed Models ⋮ Optimal sampling from sliding windows ⋮ Unnamed Item ⋮ Arithmetic sketching ⋮ Efficient transformations for Klee's measure problem in the streaming model ⋮ A fast output-sensitive algorithm for Boolean matrix multiplication ⋮ Unnamed Item ⋮ Unnamed Item ⋮ New bounds for the CLIQUE-GAP problem using graph decomposition theory ⋮ Summarizing numeric spatial data streams by trend cluster discovery ⋮ Sleeping on the job: energy-efficient and robust broadcast for radio networks ⋮ Tracking the l_2 Norm with Constant Update Time ⋮ Using invariants to determine change detection in dynamical system with chaos ⋮ Dynamic graph stream algorithms in \(o(n)\) space ⋮ Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks ⋮ Using invariants to change detection in dynamical system with chaos ⋮ Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. ⋮ Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries ⋮ In-network estimation of frequency moments ⋮ Solvable integration problems and optimal sample size selection ⋮ Give me some slack: efficient network measurements ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Robust modifications of U-statistics and applications to covariance estimation problems ⋮ Geometric median and robust estimation in Banach spaces ⋮ Distributed statistical estimation and rates of convergence in normal approximation ⋮ Regular Programming for Quantitative Properties of Data Streams ⋮ Nearly optimal robust mean estimation via empirical characteristic function ⋮ Approximate set union via approximate randomization ⋮ Optimal confidence for Monte Carlo integration of smooth functions ⋮ Querying a Matrix Through Matrix-Vector Products. ⋮ Near-optimal clustering in the \(k\)-machine model ⋮ Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation ⋮ Robust and Scalable Bayes via a Median of Subset Posterior Measures ⋮ Robust and efficient mean estimation: an approach based on the properties of self-normalized sums ⋮ Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem ⋮ Unnamed Item ⋮ Arthur-Merlin streaming complexity
This page was built for publication:
