activity
20112025
most citedComputing Distances between Probabilistic Automata

19 citations · 26 across the 5 of their papers we have counts for

collaborators

7 papers

cs.LO2025

-Distance via Lévy-Prokhorov Lifting

Josée Desharnais, Ana Sokolova

The most studied and accepted pseudometric for probabilistic processes is one based on the Kantorovich distance between distributions. It comes with many theoretical and motivating…

cs.CR2024

GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data

Sofiane Azogagh, Zelma Aubin Birba, Josée Desharnais +3

Cryptographic approaches, such as secure multiparty computation, can be used to compute in a secure manner the function of a distributed graph without centralizing the data of each…

cs.CR2022

Unsupervised User-Based Insider Threat Detection Using Bayesian Gaussian Mixture Models

Simon Bertrand, Nadia Tawbi, Josée Desharnais

Insider threats are a growing concern for organizations due to the amount of damage that their members can inflict by combining their privileged access and domain knowledge. Noneth…

cs.LG2020

Out-of-distribution detection for regression tasks: parameter versus predictor entropy

Yann Pequignot, Mathieu Alain, Patrick Dallaire +4

It is crucial to detect when an instance lies downright too far from the training samples for the machine learning model to be trusted, a challenge known as out-of-distribution (OO…

cs.DM2020

General Cops and Robbers Games with randomness

Frédéric Simard, Josée Desharnais, François Laviolette

Cops and Robbers games have been studied for the last few decades in computer science and mathematics. As in general pursuit evasion games, pursuers (cops) seek to capture evaders…

cs.FL2011★ 19 cited

Computing Distances between Probabilistic Automata

Mathieu Tracol, Josée Desharnais, Abir Zhioua

We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA), that allow some error epsilon. When epsilon is zero we retrieve the usual notions of bisim…