scientific article
From MaRDI portal
Publication:3425115
zbMath1128.68025MaRDI QIDQ3425115
No author found.
Publication date: 5 March 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Nonnumerical algorithms (68W05) Data structures (68P05) General topics in the theory of data (68P01)
Related Items
Randomized numerical linear algebra: Foundations and algorithms, Uniformity of Point Samples in Metric Spaces Using Gap Ratio, A survey on compressive sensing: classical results and recent advancements, Towards Optimal Moment Estimation in Streaming and Distributed Models, Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity, Towards Optimal Moment Estimation in Streaming and Distributed Models, Streaming deletion problems Parameterized by vertex cover, Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches, Massively parallel and streaming algorithms for balanced clustering, Matroid-constrained vertex cover, Classical and Quantum Computations with Restricted Memory, A Dynamic Distributed Data Structure for Top-k and k-Select Queries, Learning to Forecast Dynamical Systems from Streaming Data, \textsf{LotterySampling}: a randomized algorithm for the heavy hitters and top-\(k\) problems in data streams, Unnamed Item, On streaming algorithms for geometric independent set and clique, Distributed coloring of hypergraphs, Space limited linear-time graph algorithms on big data, Unnamed Item, Improved Algorithms for Time Decay Streams, Modeling support changes in streaming item sets, Semi-streaming algorithms for submodular matroid intersection, On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms, Semi-streaming algorithms for submodular matroid intersection, Streaming algorithms for line simplification, Depth First Search in the Semi-streaming Model, Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation, Real-Time Streaming Multi-Pattern Search for Constant Alphabet, Perfect $L_p$ Sampling in a Data Stream, Unnamed Item, Sparsity optimization in design of multidimensional filter networks, Low-Rank Tucker Approximation of a Tensor from Streaming Data, Computation by interaction for space-bounded functional programming, 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, Finding Articulation Points of Large Graphs in Linear Time, New techniques and tighter bounds for local computation algorithms, 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, Streaming deletion problems parameterized by vertex cover, Maximum Matching in Turnstile Streams, \textsf{StreaMRAK} a streaming multi-resolution adaptive kernel algorithm, Optimal per-edge processing times in the semi-streaming model, A Statistical Analysis of Probabilistic Counting Algorithms, A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions, Streaming algorithms for independent sets in sparse hypergraphs, Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing, A Framework for Adversarially Robust Streaming Algorithms, Triangle counting in dynamic graph streams, Memory-constrained algorithms for simple polygons, Streaming algorithms for multitasking scheduling with shared processing, Computing the longest common almost-increasing subsequence, Improved Algorithms for Adaptive Compressed Sensing, Permuted function matching, Interval selection in the streaming model, Reprint of: Memory-constrained algorithms for simple polygons, Streaming algorithms for language recognition problems, Regenerative random permutations of integers, Adapting parallel algorithms to the W-stream model, with applications to graph problems, A Black Box for Online Approximate Pattern Matching, A note on randomized streaming space bounds for the longest increasing subsequence problem, Approximation of function evaluation over sequence arguments via specialized data structures, Optimal sampling from sliding windows, Weighted matching in the semi-streaming model, Continuous monitoring of distributed data streams over a time-based sliding window, Simplified Planar Coresets for Data Streams, Intractability of min- and max-cut in streaming graphs, Lightweight data indexing and compression in external memory, Single Pass Spectral Sparsification in Dynamic Streams, Single-pass streaming algorithms to partition graphs into few forests, Know when to persist: deriving value from a stream buffer, Drawing trees in a streaming model, Improved bounds for randomized preemptive online matching, From approximate balls to approximate ellipses, Sleeping on the job: energy-efficient and robust broadcast for radio networks, Transfer estimation of evolving class priors in data stream classification, Fast computation of a longest increasing subsequence and application, Streaming techniques and data aggregation in networks of tiny artefacts, FANCFIS: fast adaptive neuro-complex fuzzy inference system, Labeled graph sketches: keeping up with real-time graph streams, Competitive analysis of maintaining frequent items of a stream, Adaptively learning probabilistic deterministic automata from data streams, Sampling Technique for Complex Data, Approximating frequent items in asynchronous data stream over a sliding window, Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams, Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering, Discrete optimization methods for group model selection in compressed sensing, Boosting distinct random sampling for basic counting on the union of distributed streams, Dynamic graph stream algorithms in \(o(n)\) space, Streaming pattern matching with \(d\) wildcards, On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms, Efficient uncertainty quantification of CFD problems by combination of proper orthogonal decomposition and compressed sensing, New results for finding common neighborhoods in massive graphs in the data stream model, Adaptive sampling for geometric problems over data streams, In-network estimation of frequency moments, Revising Type-2 Computation and Degrees of Discontinuity, Small space representations for metric min-sum \(k\)-clustering and their applications, Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing, Sorting and selection on dynamic data, Combinatorial sublinear-time Fourier algorithms, Sorting streamed multisets, Deterministic \(k\)-set structure, 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, A black box for online approximate pattern matching, The frequent items problem, under polynomial decay, in the streaming model, Unnamed Item, Exponential separation of quantum and classical online space complexity, Two improved range-efficient algorithms for \(F_0\) estimation, How to catch \(L_2\)-heavy-hitters on sliding windows, Less is More: Sparse Graph Mining with Compact Matrix Decomposition, A general method for estimating correlated aggregates over a data stream, Distributed mining of time-faded heavy hitters, Frequent Directions: Simple and Deterministic Matrix Sketching, An efficient multifidelity \(\ell_1\)-minimization method for sparse polynomial chaos, Clique Counting in MapReduce, Know When to Persist: Deriving Value from a Stream Buffer, New bounds on classical and quantum one-way communication complexity, Space efficient linear time algorithms for BFS, DFS and applications, Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem, Weighted random sampling with a reservoir, Almost-smooth histograms and sliding-window graph algorithms, Tight Bounds for the Subspace Sketch Problem with Applications, Unnamed Item, On graph problems in a semi-streaming model, Streaming algorithms for extent problems in high dimensions, Linear-time parameterized algorithms with limited local resources, Arthur-Merlin streaming complexity, Efficient sampling of non-strict turnstile data streams
