WP-events

Orateur : Élie de Panafieu La question qui guidera l'exposé est l'étude de la loi limite du nombre de triangles dans un graphes aléatoire à [...]

We propose a novel algorithm for the hierarchical clustering of graphs. The algorithm is a simple but key modification of the Louvain algorithm based on [...]

Nathan De Lara will introduce the knowledge graph embeddings, based on the following references: Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., and Yakhnenko, O. [...]

In this session of the reading group, Anastasios Giovanidis will present the paper O. Fercoq, M. Akian, M. Bouhtou, S. Gaubert. “Ergodic control and polyhedral [...]

 Abstract: In this talk, I present our ongoing work on utilising edge-computing to improve the scalability and privacy of user-centred analytics in the context of [...]