arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1903.03520cs.DS
收藏

动态时间弯曲距离的单向通信复杂性

The One-Way Communication Complexity of Dynamic Time Warping Distance

Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang

摘要:

我们解决了动态时间规整(DTW)距离的随机单向通信复杂性。我们表明,有一个有效的单向通信协议,使用$\widetilde{O}(n/α)$位的问题计算的$α$ -近似DTW之间的字符串$x$和$y$的长度$n$,我们证明了一个下界的$Ω(n / α)$位相同的问题。我们的通信协议适用于多项式大小和纵横比的任意度量的字符串,并且我们根据底层度量的属性来优化对数因子,例如当点是配备有各种度量的低维整数向量或具有有界双倍维数时。我们也考虑DTW的线性草图,表明这样的草图必须有大小$Ω(n)$。

英文摘要:

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 $\widetilde{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)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑