Data streams: algorithms and applications.
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Data Streams: Algorithms and Applications
- Low-rank Tucker approximation of a tensor from streaming data
- Lightweight data indexing and compression in external memory
- Single-pass streaming algorithms to partition graphs into few forests
- Approximate range searching: The absolute model
- Space limited linear-time graph algorithms on big data
- Improved Algorithms for Time Decay Streams
- Competitive analysis of maintaining frequent items of a stream
- Adaptively learning probabilistic deterministic automata from data streams
- Streaming algorithms for multitasking scheduling with shared processing
- Uniformity of point samples in metric spaces using gap ratio
- Distributed mining of time-faded heavy hitters
- Clique counting in MapReduce: algorithms and experiments
- Permuted function matching
- On Approximation Algorithms for Data Mining Applications
- Two improved range-efficient algorithms for \(F_0\) estimation
- Dilemmas of robust analysis of economic data streams
- Learning to Forecast Dynamical Systems from Streaming Data
- Streaming zero-knowledge proofs
- Space efficient linear time algorithms for BFS, DFS and applications
- Intractability of min- and max-cut in streaming graphs
- Fast computation of a longest increasing subsequence and application
- Streaming algorithms for scheduling jobs with priorities
- Tight bounds for the subspace sketch problem with applications
- Disjunctive complexity
- Sleeping on the job: energy-efficient and robust broadcast for radio networks
- scientific article; zbMATH DE number 7758318 (Why is no real title available?)
- A survey on compressive sensing: classical results and recent advancements
- (Noisy) gap cycle counting strikes back: random order streaming lower bounds for connected components and beyond
- Boosting distinct random sampling for basic counting on the union of distributed streams
- Optimal per-edge processing times in the semi-streaming model
- Subgradient-based tableau pivot method for sparse signal recovery
- Transfer estimation of evolving class priors in data stream classification
- Tight bounds for single-pass streaming complexity of the set cover problem
- Turning big data into tiny data: coresets for unsupervised learning problems
- \textsf{LotterySampling}: a randomized algorithm for the heavy hitters and top-\(k\) problems in data streams
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet
- Preface: Processing and mining complex data streams
- Spiking neural networks through the lens of streaming algorithms
- Know when to persist: deriving value from a stream buffer
- Streaming algorithms for extent problems in high dimensions
- Modeling support changes in streaming item sets
- Graphical Lasso and thresholding: equivalence and closed-form solutions
- The frequent items problem, under polynomial decay, in the streaming model
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
- Data streams and applications in computer science
- Streaming low-rank matrix approximation with an application to scientific simulation
- Almost-smooth histograms and sliding-window graph algorithms
- Know when to persist: deriving value from a stream buffer (extended abstract)
- Fast identification of heavy hitters by cached and packed group testing
- Quantum algorithms for the most frequently string search, intersection of two string sequences and sorting of strings problems
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
- Adversarially robust streaming algorithms via differential privacy
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- scientific article; zbMATH DE number 7650128 (Why is no real title available?)
- Reprint of: Memory-constrained algorithms for simple polygons
- Streaming deletion problems Parameterized by vertex cover
- On streaming algorithms for geometric independent set and clique
- Streaming algorithms for language recognition problems
- Adaptive sampling for geometric problems over data streams
- New results for finding common neighborhoods in massive graphs in the data stream model
- Towards Optimal Moment Estimation in Streaming and Distributed Models
- Classical and Quantum Computations with Restricted Memory
- Depth First Search in the Semi-streaming Model
- On graph problems in a semi-streaming model
- Testing properties of distributions in the streaming model
- A Dynamic Distributed Data Structure for Top-k and k-Select Queries
- Signature-based methods for data streams
- In-network estimation of frequency moments
- Linear-time parameterized algorithms with limited local resources
- Data stream management systems: a response to large scale scientific data requirements
- Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity
- Adapting parallel algorithms to the W-stream model, with applications to graph problems
- Less is More: Sparse Graph Mining with Compact Matrix Decomposition
- Arthur-Merlin streaming complexity
- Small space representations for metric min-sum k-clustering and their applications
- Sublinear algorithms for scheduling with chain precedence constraints
- Labeled graph sketches: keeping up with real-time graph streams
- Streaming graph algorithms in the massively parallel computation model
- Computation by interaction for space-bounded functional programming
- Sparsity optimization in design of multidimensional filter networks
- Sorting and selection on dynamic data
- Matroid-constrained vertex cover
- Weighted matching in the semi-streaming model
- Massively parallel and streaming algorithms for balanced clustering
- Regenerative random permutations of integers
- An efficient multifidelity \(\ell_1\)-minimization method for sparse polynomial chaos
- Single pass spectral sparsification in dynamic streams
- Efficient uncertainty quantification of CFD problems by combination of proper orthogonal decomposition and compressed sensing
- A note on randomized streaming space bounds for the longest increasing subsequence problem
- Optimal sampling from sliding windows
- Deterministic \(k\)-set structure
- Sorting streamed multisets
- A Framework for Adversarially Robust Streaming Algorithms
- Memory-constrained algorithms for simple polygons
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Maximum matching in turnstile streams
- Randomized numerical linear algebra: Foundations and algorithms
- Streaming algorithms for line simplification
This page was built for publication: Data streams: algorithms and applications.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3425115)
