no code implementations • 8 Mar 2021 • Evangelos Kipouridis, Paul G. Spirakis, Kostas Tsichlas
In particular, in each discrete round $t$, each pair of nodes $u$ and $v$ that are allowed to communicate by the scheduler, computes a value $\mathcal{E}(u, v)$ (the potential of the pair) as a function of the local structure of the network at round $t$ around the two nodes.
Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
1 code implementation • 21 Feb 2019 • Theodoros Toliopoulos, Anastasios Gounaris, Kostas Tsichlas, Apostolos Papadopoulos, Sandra Sampaio
In recent years, several solutions have tackled the problem of distance-based outliers in data streams, where outliers must be mined continuously as new elements become available.
