Pages that link to "Item:Q3455212"

The following pages link to Stable distributions, pseudorandom generators, embeddings, and data stream computation (Q3455212):

Displaying 44 items.

• A unified framework for linear dimensionality reduction in L1 (Q310869) (← links)
• Streaming algorithms for language recognition problems (Q391078) (← links)
• A unified scheme for generalizing cardinality estimators to sum aggregation (Q477684) (← links)
• Real-valued embeddings and sketches for fast distance and similarity estimation (Q508585) (← links)
• Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
• Multiple pass streaming algorithms for learning mixtures of distributions in \(\mathbb R^d\) (Q1017656) (← links)
• Graph summarization with quality guarantees (Q1741300) (← links)
• On finding common neighborhoods in massive graphs. (Q1874417) (← links)
• Variance reduction in feature hashing using MLE and control variate method (Q2102328) (← links)
• Recent advances in text-to-pattern distance algorithms (Q2106622) (← links)
• Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\) (Q2110372) (← links)
• Linear dimension reduction approximately preserving a function of the $1$-norm (Q2219215) (← links)
• The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite (Q2380779) (← links)
• Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q2695266) (← links)
• The Fast Cauchy Transform and Faster Robust Linear Regression (Q2812147) (← links)
• A Statistical Analysis of Probabilistic Counting Algorithms (Q2911701) (← links)
• Single Pass Spectral Sparsification in Dynamic Streams (Q2968162) (← links)
• Periodicity and Cyclic Shifts via Linear Sketches (Q3088091) (← links)
• The Andoni–Krauthgamer–Razenshteyn Characterization of Sketchable Norms Fails for Sketchable Metrics (Q3384132) (← links)
• Taylor Polynomial Estimator for Estimating Frequency Moments (Q3448814) (← links)
• Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$ (Q3520061) (← links)
• Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
• Representation and coding of signal geometry (Q4603712) (← links)
• Less is More: Sparse Graph Mining with Compact Matrix Decomposition (Q4969614) (← links)
• Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610) (← links)
• Continuous Monitoring of l_p Norms in Data Streams (Q5002635) (← links)
• (Q5009507) (← links)
• Tight Bounds for the Subspace Sketch Problem with Applications (Q5009789) (← links)
• Depth First Search in the Semi-streaming Model (Q5090492) (← links)
• Two Party Distribution Testing: Communication and Security (Q5091163) (← links)
• (Q5091258) (← links)
• Optimality of linear sketching under modular updates (Q5091764) (← links)
• (Q5115789) (← links)
• On Approximating Matrix Norms in Data Streams (Q5244397) (← links)
• On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ (Q5499733) (← links)
• Perfect $L_p$ Sampling in a Data Stream (Q5858643) (← links)
• Tracking the l_2 Norm with Constant Update Time (Q5875453) (← links)
• Towards Optimal Moment Estimation in Streaming and Distributed Models (Q5875483) (← links)
• Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1 (Q5875504) (← links)
• Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms (Q5885598) (← links)
• (Q6062160) (← links)
• Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
• Spiking neural networks through the lens of streaming algorithms (Q6535007) (← links)
• Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q6623584) (← links)