Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales

Terms and Conditions

Twitter GitHub LinkedIn Bluesky Youtube

© 2026 ResearchTrend.AI, All rights reserved.

Home
Papers
2003.11246
Cited By

FastDTW is approximate and Generally Slower than the Algorithm it
Approximates

v1v2v3v4v5 (latest)

FastDTW is approximate and Generally Slower than the Algorithm it Approximates

IEEE International Conference on Data Engineering (ICDE), 2020

25 March 2020

Eamonn J. Keogh

ArXiv (abs)PDF HTML

Papers citing "FastDTW is approximate and Generally Slower than the Algorithm it Approximates"

2 / 2 papers shown

Identifying On-road Scenarios Predictive of ADHD usingDriving Simulator
Time Series Data

Identifying On-road Scenarios Predictive of ADHD usingDriving Simulator Time Series Data

David Grethlein

Aleksanteri Sladek

Santiago Ontañón

153

0

0

12 Nov 2021

IRMAC: Interpretable Refined Motifs in Binary Classification for Smart
Grid Applications

IRMAC: Interpretable Refined Motifs in Binary Classification for Smart Grid ApplicationsEngineering applications of artificial intelligence (EAAI), 2021

S. A. Pourmousavi

Jon A. R. Liisberg

222

9

0

23 Sep 2021

Page 1 of 1