Pages that link to "Item:Q1305928"
From MaRDI portal
The following pages link to The space complexity of approximating the frequency moments (Q1305928):
Displayed 50 items.
- Random projections for Bayesian regression (Q144017) (← links)
- Space-efficient estimation of statistics over sub-sampled streams (Q262266) (← links)
- Robust estimation of \(U\)-statistics (Q335650) (← links)
- Certifying equality with limited interaction (Q343864) (← links)
- Adapting parallel algorithms to the W-stream model, with applications to graph problems (Q410728) (← links)
- A note on randomized streaming space bounds for the longest increasing subsequence problem (Q413292) (← links)
- Estimating hybrid frequency moments of data streams (Q431931) (← links)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- Streaming techniques and data aggregation in networks of tiny artefacts (Q465668) (← links)
- Competitive analysis of maintaining frequent items of a stream (Q476837) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- Boosting distinct random sampling for basic counting on the union of distributed streams (Q497679) (← links)
- Fingerprints for highly similar streams (Q498399) (← links)
- Noise dependency of algorithms for calculating fractal dimensions in digital images (Q502926) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- Best-order streaming model (Q534570) (← links)
- Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable (Q538463) (← links)
- Partition arguments in multiparty communication complexity (Q541668) (← links)
- Stochastic convergence of random search methods to fixed size Pareto front approximations (Q545118) (← links)
- An information statistics approach to data stream and communication complexity (Q598248) (← links)
- Statistical estimation with bounded memory (Q693352) (← links)
- Tracking join and self-join sizes in limited storage (Q696969) (← links)
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- Tradeoff lower lounds for stack machines (Q744614) (← links)
- A general method for estimating correlated aggregates over a data stream (Q747615) (← links)
- A note on efficient aggregate queries in sensor networks (Q868957) (← links)
- Empirical risk minimization for heavy-tailed losses (Q892246) (← links)
- Deterministic \(k\)-set structure (Q975518) (← links)
- A note on compressed sensing and the complexity of matrix multiplication (Q987795) (← links)
- Two improved range-efficient algorithms for \(F_0\) estimation (Q1007249) (← links)
- Sketching information divergences (Q1009269) (← links)
- Hierarchical sampling from sketches: Estimating functions over data streams (Q1016526) (← links)
- Multiple pass streaming algorithms for learning mixtures of distributions in \(\mathbb R^d\) (Q1017656) (← links)
- On finding common neighborhoods in massive graphs. (Q1874417) (← links)
- Finding frequent items in data streams (Q1884870) (← links)
- Optimal tracking of distributed heavy hitters and quantiles (Q1939670) (← links)
- Applying approximate counting for computing the frequency moments of long data streams (Q2272207) (← links)
- Database query processing using finite cursor machines (Q2272221) (← 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)
- 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)