Pages that link to "Item:Q1305928"
From MaRDI portal
The following pages link to The space complexity of approximating the frequency moments (Q1305928):
Displayed 17 items.
- (Q5875523) (← links)
- Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
- Derandomization for sliding window algorithms with strict correctness (Q5918353) (← links)
- Approximate set union via approximate randomization (Q5919116) (← links)
- Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity (Q6039898) (← links)
- A robust estimator of the S-Gini index for massive data (Q6050483) (← links)
- Three‐wise independent random walks can be slightly unbounded (Q6052485) (← links)
- A robust estimator of the proportional hazard transform for massive data (Q6075443) (← links)
- (Q6084405) (← links)
- Non-asymptotic analysis and inference for an outlyingness induced winsorized mean (Q6089298) (← links)
- Robust distributed multicategory angle-based classification for massive data (Q6118393) (← links)
- Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space (Q6140352) (← links)
- Statistical-computational trade-offs in tensor PCA and related problems via communication complexity (Q6151966) (← links)
- Robust supervised learning with coordinate gradient descent (Q6172182) (← links)
- On streaming algorithms for geometric independent set and clique (Q6176560) (← links)
- Mean estimation in high dimension (Q6200221) (← links)