research
∙
07/06/2023
A Near-Linear Time Algorithm for the Chamfer Distance
For any two point sets A,B ⊂ℝ^d of size up to n, the Chamfer distance fr...
share
research
∙
05/01/2022
The Johnson-Lindenstrauss Lemma for Clustering and Subspace Approximation: From Coresets to Dimension Reduction
We study the effect of Johnson-Lindenstrauss transforms in various Eucli...
research
∙
10/03/2019
Finding monotone patterns in sublinear time
We study the problem of finding monotone subsequences in an array from t...
research
∙
04/10/2019
Testing Unateness Nearly Optimally
We present an Õ(n^2/3/ϵ^2)-query algorithm that tests whether an unknown...
research
∙
05/03/2018
Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs
We introduce a new model for testing graph properties which we call the ...
research
∙
08/19/2017
