Zobrazeno 1 - 10
of 111
pro vyhledávání: '"Tsichlas, Kostas"'
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
In the unit-cost comparison model, a black box takes an input two items and outputs the result of the comparison. Problems like sorting and searching have been studied in this model, and it has been generalized to include the concept of priced inform
Externí odkaz:
http://arxiv.org/abs/2004.13197
Autor:
Toliopoulos, Theodoros, Gounaris, Anastasios, Tsichlas, Kostas, Papadopoulos, Apostolos, Sampaio, Sandra
In this work, we focus on distance-based outliers in a metric space, where the status of an entity as to whether it is an outlier is based on the number of other entities in its neighborhood. In recent years, several solutions have tackled the proble
Externí odkaz:
http://arxiv.org/abs/1902.07901
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
Autor:
Thomopoulos, Vasileios1 (AUTHOR) ktsichlas@ceid.upatras.gr, Tsichlas, Kostas1 (AUTHOR)
Publikováno v:
Information (2078-2489). Mar2024, Vol. 15 Issue 3, p150. 20p.
Publikováno v:
In Theoretical Computer Science 25 January 2023 944
Autor:
Sioutas, Spyros, Tsichlas, Kostas, Kosmatopoulos, Andreas, Papadopoulos, Apostolos N., Tsoumakos, Dimitrios, Doka, Katerina
The skyline of a set $P$ of points ($SKY(P)$) consists of the "best" points with respect to minimization or maximization of the attribute values. A point $p$ dominates another point $q$ if $p$ is as good as $q$ in all dimensions and it is strictly be
Externí odkaz:
http://arxiv.org/abs/1709.03949
Autor:
Kejlberg-Rasmussen, Casper, Tao, Yufei, Tsakalidis, Konstantinos, Tsichlas, Kostas, Yoon, Jeonghun
Publikováno v:
In Computational Geometry: Theory and Applications February 2021 93
Suppose we have a virus or one competing idea/product that propagates over a multiple profile (e.g., social) network. Can we predict what proportion of the network will actually get "infected" (e.g., spread the idea or buy the competing product), whe
Externí odkaz:
http://arxiv.org/abs/1504.03306