2000 character limit reached
Time warping with Hellinger elasticity
Published 9 Mar 2026 in cs.IR, cs.DS, and math.MG | (2603.08807v1)
Abstract: We consider a matching problem for time series with values in an arbitrary metric space, with the stretching penalty given by the Hellinger kernel. To optimize this matching, we introduce the Elastic Time Warping algorithm with a cubic computational complexity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.