
Functions that Preserve Manhattan Distances
What functions, when applied to the pairwise Manhattan distances between...
read it

Algorithms and Hardness for Linear Algebra on Geometric Graphs
For a function šŖ : ā^dĆā^dāā_ā„ 0, and a set P = { x_1, ā¦, x_n}āā^d of n ...
read it

Weighted Cheeger and Buser Inequalities, with Applications to Clustering and Cutting Probability Densities
In this paper, we show how sparse or isoperimetric cuts of a probability...
read it

Constant Arboricity Spectral Sparsifiers
We show that every graph is spectrally similar to the union of a constan...
read it

Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions
We develop a framework for graph sparsification and sketching, based on ...
read it

Intrinsic Metrics: Exact Equality between a Geodesic Metric and a Graph metric
Some researchers have proposed using nonEuclidean metrics for clusterin...
read it

Intrinsic Metrics: Nearest Neighbor and Edge Squared Distances
Some researchers have proposed using nonEuclidean metrics for clusterin...
read it
Timothy Chu
is this you? claim profile