ResearchTrend.AI
Optimal Warping Paths are unique for almost every Pair of Time Series

Optimal Warping Paths are unique for almost every Pair of Time Series

Brijnesh J. Jain
David Schultz
ArXivPDFHTML

Papers citing "Optimal Warping Paths are unique for almost every Pair of Time Series"

2 / 2 papers shown
Title
Asymmetric Learning Vector Quantization for Efficient Nearest Neighbor Classification in Dynamic Time Warping Spaces
Asymmetric Learning Vector Quantization for Efficient Nearest Neighbor Classification in Dynamic Time Warping Spaces
Brijnesh J. Jain
David Schultz
42
22
0
24 Mar 2017
Soft-DTW: a Differentiable Loss Function for Time-Series
Soft-DTW: a Differentiable Loss Function for Time-Series
Marco Cuturi
Mathieu Blondel
AI4TS
169
623
0
05 Mar 2017