scientific article; zbMATH DE number 2086663
From MaRDI portal
Publication:4737200
zbMath1057.68600MaRDI QIDQ4737200
No author found.
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800693.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (41)
Binary vectors for fast distance and similarity estimation ⋮ Johnson–Lindenstrauss Embeddings with Kronecker Structure ⋮ Compressive Gaussian Mixture Estimation ⋮ Mining evolving data streams for frequent patterns ⋮ Unnamed Item ⋮ Optimal (Euclidean) Metric Compression ⋮ Towards Optimal Moment Estimation in Streaming and Distributed Models ⋮ RidgeSketch: A Fast Sketching Based Solver for Large Scale Ridge Regression ⋮ Towards Optimal Moment Estimation in Streaming and Distributed Models ⋮ Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space ⋮ Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory ⋮ A Phrase Recommendation Algorithm Based on Query Stream Mining in Web Search Engines ⋮ A general framework for never-ending learning from time series streams ⋮ Tracking the l_2 Norm with Constant Update Time ⋮ Mining frequent items in data stream using time fading model ⋮ Fingerprints for highly similar streams ⋮ Buffered Count-Min Sketch on SSD: Theory and Experiments ⋮ Fast and accurate mining of correlated heavy hitters ⋮ CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams ⋮ Mining sequential patterns across time sequences ⋮ A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems ⋮ A time optimized scheme for top-\( k\) list maintenance over incomplete data streams ⋮ Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. ⋮ A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution ⋮ Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time ⋮ Mining frequent closed itemsets from a landmark window over online data streams ⋮ Deterministic \(k\)-set structure ⋮ The frequent items problem, under polynomial decay, in the streaming model ⋮ Sketching information divergences ⋮ How to catch \(L_2\)-heavy-hitters on sliding windows ⋮ Space‐efficient tracking of persistent items in a massive data stream ⋮ Hierarchical sampling from sketches: Estimating functions over data streams ⋮ Distributed mining of time-faded heavy hitters ⋮ Sparse Recovery with Partial Support Knowledge ⋮ On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy ⋮ Frequent Directions: Simple and Deterministic Matrix Sketching ⋮ A Note on Estimating Hybrid Frequency Moment of Data Streams ⋮ On Approximating Matrix Norms in Data Streams ⋮ Estimating Leverage Scores via Rank Revealing Methods and Randomization ⋮ Perfect $L_p$ Sampling in a Data Stream ⋮ Unnamed Item
This page was built for publication:
