
Quantum Topological Data Analysis with Linear Depth and Exponential Speedup
Quantum computing offers the potential of exponential speedups for certa...
read it

NearOptimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time
Currently, in the numerical linear algebra community, it is thought that...
read it

Sparse graph based sketching for fast numerical linear algebra
In recent years, a variety of randomized constructions of sketching matr...
read it

Order Embeddings from Merged Ontologies using Sketching
We give a simple, low resource method to produce order embeddings from o...
read it

QuantumInspired Algorithms from Randomized Numerical Linear Algebra
We create classical (nonquantum) dynamic data structures supporting que...
read it

Projection techniques to update the truncated SVD of evolving matrices
This paper considers the problem of updating the rankk truncated Singul...
read it

Dimensionality Reduction for Tukey Regression
We give the first dimensionality reduction methods for the overconstrain...
read it

Minimax experimental design: Bridging the gap between statistical and worstcase approaches to least squares regression
In experimental design, we are given a large collection of vectors, each...
read it

Data Infrastructure and Approaches for OntologyBased Drug Repurposing
We report development of a data infrastructure for drug repurposing that...
read it

The Fast Cauchy Transform and Faster Robust Linear Regression
We provide fast algorithms for overconstrained ℓ_p regression and relate...
read it
Kenneth L. Clarkson
is this you? claim profile
He is a researcher at the IBM Almaden Research Center, and coeditorinchief of the Journal of Computational Geometry