The following pages link to Michael B. Cohen (Q2941500):
Displaying 23 items.
- Dimensionality Reduction for k-Means Clustering and Low Rank Approximation (Q2941504) (← links)
- L <sub>p</sub> Row Sampling by Lewis Weights (Q2941506) (← links)
- Uniform Sampling for Matrix Approximation (Q2989029) (← links)
- Approximating Nearest Neighbor Distances (Q3449817) (← links)
- Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities (Q4575598) (← links)
- Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (<i>m</i><sup>10/7</sup> log <i>W</i>) Time (Extended Abstract) (Q4575786) (← links)
- Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling (Q4575860) (← links)
- Optimal Approximate Matrix Product in Terms of Stable Rank (Q4598143) (← links)
- (Q4617598) (← links)
- Online Row Sampling (Q4636437) (← links)
- Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs (Q4977989) (← links)
- Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing (Q4994985) (← links)
- Solving Linear Programs in the Current Matrix Multiplication Time (Q5056400) (← links)
- Solving linear programs in the current matrix multiplication time (Q5212834) (← links)
- k-server via multiscale entropic regularization (Q5230272) (← links)
- An homotopy method for l <sub>p</sub> regression provably beyond self-concordance and in input-sparsity time (Q5230368) (← links)
- Metrical task systems on trees via mirror descent and unfair gluing (Q5236187) (← links)
- A Nearly-Linear Bound for Chasing Nested Convex Bodies (Q5236189) (← links)
- Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. (Q5240430) (← links)
- Solving SDD linear systems in nearly <i>m</i> log <sup>1/2</sup> <i>n</i> time (Q5259568) (← links)
- Geometric median in nearly linear time (Q5361815) (← links)
- Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball (Q5383974) (← links)
- (Q5857607) (← links)
