The One-Way Communication Complexity of Dynamic Time Warping Distance

03/08/2019
by   Vladimir Braverman, et al.
0

We resolve the randomized one-way communication complexity of Dynamic Time Warping (DTW) distance. We show that there is an efficient one-way communication protocol using O(n/α) bits for the problem of computing an α-approximation for DTW between strings x and y of length n, and we prove a lower bound of Ω(n / α) bits for the same problem. Our communication protocol works for strings over an arbitrary metric of polynomial size and aspect ratio, and we optimize the logarithmic factors depending on properties of the underlying metric, such as when the points are low-dimensional integer vectors equipped with various metrics or have bounded doubling dimension. We also consider linear sketches of DTW, showing that such sketches must have size Ω(n).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2023

Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings

We give an Õ(n^2) time algorithm for computing the exact Dynamic Time Wa...
research
04/22/2019

Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation

Dynamic time warping distance (DTW) is a widely used distance measure be...
research
06/08/2018

Compressed Communication Complexity of Longest Common Prefixes

We consider the communication complexity of fundamental longest common p...
research
07/02/2022

Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings

Dynamic Time Warping (DTW) is a widely used similarity measure for compa...
research
11/24/2022

Communication Complexity of Inner Product in Symmetric Normed Spaces

We introduce and study the communication complexity of computing the inn...
research
12/06/2021

On Complexity of 1-Center in Various Metrics

We consider the classic 1-center problem: Given a set P of n points in a...
research
08/30/2020

Precise Expression for the Algorithmic Information Distance

We consider the notion of information distance between two objects x and...

Please sign up or login with your details

Forgot password? Click here to reset