Pages that link to "Item:Q1042451"

The following pages link to Fast dimension reduction using Rademacher series on dual BCH codes (Q1042451):

Displaying 22 items.

• Random projections for Bayesian regression (Q144017) (← links)
• Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
• Real-valued embeddings and sketches for fast distance and similarity estimation (Q508585) (← links)
• A variant of the Johnson-Lindenstrauss lemma for circulant matrices (Q629700) (← links)
• Dense fast random projections and Lean Walsh transforms (Q629831) (← links)
• Improved bounds for sparse recovery from subsampled random convolutions (Q1634177) (← links)
• A stability result using the matrix norm to bound the permanent (Q1650024) (← links)
• On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms (Q1986965) (← links)
• Optimal fast Johnson-Lindenstrauss embeddings for large data sets (Q2059797) (← links)
• Fast and memory-optimal dimension reduction using Kac's walk (Q2090615) (← links)
• Randomized linear algebra for model reduction. I. Galerkin methods and error estimation (Q2305558) (← links)
• Compressed dictionary learning (Q2310825) (← links)
• On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
• Fast and RIP-optimal transforms (Q2514234) (← links)
• Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence (Q2967608) (← links)
• Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← links)
• On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms (Q5136251) (← links)
• Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. (Q5240430) (← links)
• Distributed learning for sketched kernel regression (Q6079133) (← links)
• (Q6084355) (← links)
• On fast Johnson-Lindenstrauss embeddings of compact submanifolds of \(\mathbb{R}^N\) with boundary (Q6151027) (← links)
• Fast Metric Embedding into the Hamming Cube (Q6154196) (← links)