Data streams: algorithms and applications.
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Two improved range-efficient algorithms for \(F_0\) estimation
- New bounds on classical and quantum one-way communication complexity
- Weighted random sampling with a reservoir
- Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing
- Permuted function matching
- Know when to persist: deriving value from a stream buffer
- Improved bounds for randomized preemptive online matching
- FANCFIS: fast adaptive neuro-complex fuzzy inference system
- Approximating frequent items in asynchronous data stream over a sliding window
- Dynamic graph stream algorithms in \(o(n)\) space
- Streaming pattern matching with \(d\) wildcards
- Stream data management.
- Intractability of min- and max-cut in streaming graphs
- From approximate balls to approximate ellipses
- Transfer estimation of evolving class priors in data stream classification
- Fast computation of a longest increasing subsequence and application
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
- Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing
- Distributed mining of time-faded heavy hitters
- Almost-smooth histograms and sliding-window graph algorithms
- Linear-time parameterized algorithms with limited local resources
- Streaming deletion problems parameterized by vertex cover
- \textsf{StreaMRAK} a streaming multi-resolution adaptive kernel algorithm
- A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions
- Streaming algorithms for multitasking scheduling with shared processing
- Computing the longest common almost-increasing subsequence
- Labeled graph sketches: keeping up with real-time graph streams
- Discrete optimization methods for group model selection in compressed sensing
- Efficient uncertainty quantification of CFD problems by combination of proper orthogonal decomposition and compressed sensing
- Approximate range searching: The absolute model
- Applying approximate counting for computing the frequency moments of long data streams
- Database query processing using finite cursor machines
- An efficient multifidelity \(\ell_1\)-minimization method for sparse polynomial chaos
- Space efficient linear time algorithms for BFS, DFS and applications
- Streaming algorithms for extent problems in high dimensions
- Arthur-Merlin streaming complexity
- Efficient sampling of non-strict turnstile data streams
- Sparsity optimization in design of multidimensional filter networks
- Tight lower bounds for query processing on streaming and external memory data
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- Optimal per-edge processing times in the semi-streaming model
- Memory-constrained algorithms for simple polygons
- Regenerative random permutations of integers
- Weighted matching in the semi-streaming model
- Continuous monitoring of distributed data streams over a time-based sliding window
- Lightweight data indexing and compression in external memory
- Data streams. Models and algorithms.
- Adaptive sampling for geometric problems over data streams
- On graph problems in a semi-streaming model
- New techniques and tighter bounds for local computation algorithms
- Single-pass streaming algorithms to partition graphs into few forests
- Computation by interaction for space-bounded functional programming
- Frequent directions: simple and deterministic matrix sketching
- Clique counting in MapReduce: algorithms and experiments
- Know when to persist: deriving value from a stream buffer (extended abstract)
- 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
- A statistical analysis of probabilistic counting algorithms
- Single pass spectral sparsification in dynamic streams
- Streaming algorithms for independent sets in sparse hypergraphs
- Sampling Technique for Complex Data
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Dilemmas of robust analysis of economic data streams
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity
- Finding articulation points of large graphs in linear time
- Maximum matching in turnstile streams
- A Black Box for Online Approximate Pattern Matching
- Simplified Planar Coresets for Data Streams
- Data Streams: Algorithms and Applications
- Streaming Algorithms for Data in Motion
- Reprint of: Memory-constrained algorithms for simple polygons
- Streaming algorithms for language recognition problems
- Adapting parallel algorithms to the W-stream model, with applications to graph problems
- A note on randomized streaming space bounds for the longest increasing subsequence problem
- Optimal sampling from sliding windows
- Drawing trees in a streaming model
- Graphical Lasso and thresholding: equivalence and closed-form solutions
- Streaming techniques and data aggregation in networks of tiny artefacts
- Competitive analysis of maintaining frequent items of a stream
- Adaptively learning probabilistic deterministic automata from data streams
- Revising type-2 computation and degrees of discontinuity
- scientific article; zbMATH DE number 1424324 (Why is no real title available?)
- Data streams and applications in computer science
- Less is More: Sparse Graph Mining with Compact Matrix Decomposition
- Boosting distinct random sampling for basic counting on the union of distributed streams
- Tight bounds for single-pass streaming complexity of the set cover problem
- Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
- Improved algorithms for adaptive compressed sensing
- Tight bounds for the subspace sketch problem with applications
- Low-rank Tucker approximation of a tensor from streaming data
- A Framework for Adversarially Robust Streaming Algorithms
- Preface: Processing and mining complex data streams
- The space complexity of mirror games
- Depth First Search in the Semi-streaming Model
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
- Streaming low-rank matrix approximation with an application to scientific simulation
- In-network estimation of frequency moments
- Uniformity of point samples in metric spaces using gap ratio
- Sorting and selection on dynamic data
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)
