Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Kipouridis, Evangelos"'
Autor:
Bringmann, Karl, Fischer, Nick, van der Hoog, Ivor, Kipouridis, Evangelos, Kociumaka, Tomasz, Rotenberg, Eva
The Dynamic Time Warping (DTW) distance is a popular similarity measure for polygonal curves (i.e., sequences of points). It finds many theoretical and practical applications, especially for temporal data, and is known to be a robust, outlier-insensi
Externí odkaz:
http://arxiv.org/abs/2310.18128
Autor:
Kipouridis, Evangelos
In the $L_0$ Fitting Tree Metrics problem, we are given all pairwise distances among the elements of a set $V$ and our output is a tree metric on $V$. The goal is to minimize the number of pairwise distance disagreements between the input and the out
Externí odkaz:
http://arxiv.org/abs/2307.16066
Given an $n$-vertex planar embedded digraph $G$ with non-negative edge weights and a face $f$ of $G$, Klein presented a data structure with $O(n\log n)$ space and preprocessing time which can answer any query $(u,v)$ for the shortest path distance in
Externí odkaz:
http://arxiv.org/abs/2111.07360
Autor:
Cohen-Addad, Vincent, Das, Debarati, Kipouridis, Evangelos, Parotsidis, Nikos, Thorup, Mikkel
We consider the numerical taxonomy problem of fitting a positive distance function ${D:{S\choose 2}\rightarrow \mathbb R_{>0}}$ by a tree metric. We want a tree $T$ with positive edge weights and including $S$ among the vertices so that their distanc
Externí odkaz:
http://arxiv.org/abs/2110.02807
The interest in dynamic processes on networks is steadily rising in recent years. In this paper, we consider the $(\alpha,\beta)$-Thresholded Network Dynamics ($(\alpha,\beta)$-Dynamics), where $\alpha\leq \beta$, in which only structural dynamics (d
Externí odkaz:
http://arxiv.org/abs/2103.04955
Autor:
Cohen-Addad, Vincent, Das, Debarati, Kipouridis, Evangelos, Parotsidis, Nikos, Thorup, Mikkel
Publikováno v:
Journal of the ACM; Apr2024, Vol. 71 Issue 2, p1-41, 41p
Autor:
Aamand, Anders, Das, Debarati, Kipouridis, Evangelos, Knudsen, Jakob B. T., Rasmussen, Peter M. R., Thorup, Mikkel
To get estimators that work within a certain error bound with high probability, a common strategy is to design one that works with constant probability, and then boost the probability using independent repetitions. Important examples of this approach
Externí odkaz:
http://arxiv.org/abs/2004.01156
The apparent disconnection between the microscopic and the macroscopic is a major issue in the understanding of complex systems. To this extend, we study the convergence of repeatedly applying local rules on a network, and touch on the expressive pow
Externí odkaz:
http://arxiv.org/abs/1902.04121
We consider the general problem of the Longest Common Subsequence (LCS) on weighted sequences. Weighted sequences are an extension of classical strings, where in each position every letter of the alphabet may occur with some probability. Previous res
Externí odkaz:
http://arxiv.org/abs/1901.04068
Publikováno v:
In Theoretical Computer Science 25 January 2023 944