activity
20142026
most citedThe Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality

19 citations · 118 across the 26 of their papers we have counts for

collaborators
Showing 2019Show all

6 papers · 1 filter

math.OC2019

Mathematical Programming Models for Mean Computation in Dynamic Time Warping Spaces

Vincent Froese, Christoph Hansknecht

The dynamic time warping (dtw) distance is an established tool for mining time series data. The DTW-Mean problem consists of computing a series which minimizes the so-called Fréche…

cs.DM2019★ 3 cited

Persistent Graphs and Cyclic Polytope Triangulations

Vincent Froese, Malte Renken

We prove a bijection between the triangulations of the 3-dimensional cyclic polytope C(n+2, 3) and persistent graphs with n vertices. We show that under this bijection the Stasheff…

cs.DS2019

An Average-Compress Algorithm for the Sample Mean Problem under Dynamic Time Warping

Brijnesh Jain, Vincent Froese, David Schultz

Computing a sample mean of time series under dynamic time warping (DTW) is NP-hard. Consequently, there is an ongoing research effort to devise efficient heuristics. The majority o…

cs.DS2019

Good Things Come to Those Who Swap Objects on Paths

Matthias Bentert, Jiehua Chen, Vincent Froese +1

We study a simple exchange market, introduced by Gourvés, Lesca and Wilczynski (IJCAI-17), where every agent initially holds a single object. The agents have preferences over the o…

cs.CG2019★ 4 cited

Advancing Through Terrains

Vincent Froese, Malte Renken

We study terrain visibility graphs, a well-known graph class closely related to polygon visibility graphs in computational geometry, for which a precise graph-theoretical character…

cs.DS2019

Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series

Vincent Froese, Brijnesh Jain, Maciej Rymar +1

Dynamic Time Warping (DTW) is a well-known similarity measure for time series. The standard dynamic programming approach to compute the DTW distance of two length- time series,…