research
∙
02/21/2019
On the hardness of computing an average curve
We study the complexity of clustering curves under k-median and k-center...
share
research
∙
07/23/2018
SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension
We show by reduction from the Orthogonal Vectors problem that algorithms...
research
∙
05/03/2018
