The following pages link to (Q4228450):
Displaying 50 items.
- Geometric median and robust estimation in Banach spaces (Q122792) (← links)
- Streaming algorithms for language recognition problems (Q391078) (← links)
- Optimal sampling from sliding windows (Q414877) (← links)
- In-network estimation of frequency moments (Q531120) (← links)
- A fast output-sensitive algorithm for Boolean matrix multiplication (Q634680) (← links)
- Sleeping on the job: energy-efficient and robust broadcast for radio networks (Q644799) (← links)
- Fast estimation of fractal dimension and correlation integral on stream data (Q835001) (← links)
- On-board vehicle data stream monitoring using mine-fleet and fast resource constrained monitoring of correlation matrices (Q857982) (← links)
- The price of validity in dynamic networks (Q878747) (← links)
- Efficient transformations for Klee's measure problem in the streaming model (Q904110) (← links)
- Using invariants to determine change detection in dynamical system with chaos (Q940801) (← links)
- New bounds for the CLIQUE-GAP problem using graph decomposition theory (Q1709587) (← links)
- Summarizing numeric spatial data streams by trend cluster discovery (Q1711218) (← links)
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries (Q1991680) (← links)
- Solvable integration problems and optimal sample size selection (Q2001207) (← links)
- Nearly optimal robust mean estimation via empirical characteristic function (Q2040110) (← links)
- Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
- Robust and efficient mean estimation: an approach based on the properties of self-normalized sums (Q2074319) (← links)
- Property-preserving hash functions for Hamming distance from standard assumptions (Q2170070) (← links)
- Give me some slack: efficient network measurements (Q2272404) (← links)
- Robust modifications of U-statistics and applications to covariance estimation problems (Q2278677) (← links)
- Distributed statistical estimation and rates of convergence in normal approximation (Q2283576) (← links)
- Optimal confidence for Monte Carlo integration of smooth functions (Q2305562) (← links)
- Arthur-Merlin streaming complexity (Q2347803) (← links)
- Counting distinct items over update streams (Q2371800) (← links)
- Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks (Q2471714) (← links)
- Using invariants to change detection in dynamical system with chaos (Q2472651) (← links)
- Regular Programming for Quantitative Properties of Data Streams (Q2802466) (← links)
- New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory (Q2946384) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- (Q3305358) (← links)
- Linked-tree: An aggregate query algorithm based on sliding window over data stream (Q3445987) (← links)
- Robust and Scalable Bayes via a Median of Subset Posterior Measures (Q4637048) (← links)
- (Q4638058) (← links)
- Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem (Q4997308) (← links)
- (Q5002695) (← links)
- (Q5009503) (← links)
- (Q5009507) (← links)
- (Q5090388) (← links)
- (Q5091075) (← links)
- Querying a Matrix Through Matrix-Vector Products. (Q5091255) (← links)
- Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation (Q5230655) (← links)
- The Online Space Complexity of Probabilistic Languages (Q5283421) (← links)
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q5361233) (← links)
- Tracking the l_2 Norm with Constant Update Time (Q5875453) (← links)
- Towards Optimal Moment Estimation in Streaming and Distributed Models (Q5875483) (← links)
- Approximate set union via approximate randomization (Q5918258) (← links)
- Towards Optimal Moment Estimation in Streaming and Distributed Models (Q6051992) (← links)
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. (Q6058197) (← links)