6 citations · 6 across the 4 of their papers we have counts for
4 papers · 1 filter
Drift Detection: Introducing Gaussian Split Detector
Maxime Fuccellaro, Laurent Simon, Akka Zemmari
Recent research yielded a wide array of drift detectors. However, in order to achieve remarkable performance, the true class labels must be available during the drift detection pha…
Counting in One-Hop Beeping Networks
A. Casteigts, Y. Métivier, J. M. Robson +1
We consider networks of processes which interact with beeps. In the basic model defined by Cornejo and Kuhn, which we refer to as the variant, processes can choose in each rou…
Election algorithms with random delays in trees
Jean-François Marckert, Nasser Saheb-Djahromi, Akka Zemmari
The election is a classical problem in distributed algorithmic. It aims to design and to analyze a distributed algorithm choosing a node in a graph, here, in a tree. In this paper,…
A Distributed Enumeration Algorithm and Applications to All Pairs Shortest Paths, Diameter
Y. Métivier, J. M. Robson, A. Zemmari
We consider the standard message passing model; we assume the system is fully synchronous: all processes start at the same time and time proceeds in synchronised rounds. In each ro…