1 citations · 1 across the 4 of their papers we have counts for
6 papers
Efficient Greedy Discrete Subtrajectory Clustering
Ivor van der Hoog, Lara Ost, Eva Rotenberg +1
We cluster a set of trajectories T using subtrajectories of T. Clustering quality may be measured by the number of clusters, the number of vertices of T that are absent from the cl…
Banana Trees for the Persistence in Time Series Experimentally
Lara Ost, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner
In numerous fields, dynamic time series data require continuous updates, necessitating efficient data processing techniques for accurate analysis. This paper examines the banana tr…
Dynamically Maintaining the Persistent Homology of Time Series
Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger +1
We present a dynamic data structure for maintaining the persistent homology of a time series of real numbers. The data structure supports local operations, including the insertion…
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters
Kathrin Hanauer, Monika Henzinger, Lara Ost +1
Emerging reconfigurable datacenters allow to dynamically adjust the network topology in a demand-aware manner. These datacenters rely on optical switches which can be reconfigured…
Differentially Private Algorithms for Graphs Under Continual Observation
Hendrik Fichtenberger, Monika Henzinger, Lara Ost
Differentially private algorithms protect individuals in data analysis scenarios by ensuring that there is only a weak correlation between the existence of the user in the data and…
Engineering Data Reduction for Nested Dissection
Lara Ost, Christian Schulz, Darren Strash
Many applications rely on time-intensive matrix operations, such as factorization, which can be sped up significantly for large sparse matrices by interpreting the matrix as a spar…