2 citations · 5 across the 11 of their papers we have counts for
3 papers · 1 filter
Learning to Rank Anomalies: Scalar Performance Criteria and Maximization of Two-Sample Rank Statistics
Myrto Limnios, Nathan Noiry, Stéphan Clémençon
The ability to collect and store ever more massive databases has been accompanied by the need to process them efficiently. In many cases, most observations have the same behavior,…
Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm
Nathan Noiry, Flore Sentenac, Vianney Perchet
Motivated by sequential budgeted allocation problems, we investigate online matching problems where connections between vertices are not i.i.d., but they have fixed degree distribu…
Long induced paths in a configuration model
Nathanaël Enriquez, Gabriel Faraud, Laurent Ménard +1
In an article published in 1987 in Combinatorica \cite{MR918397}, Frieze and Jackson established a lower bound on the length of the longest induced path (and cycle) in a sparse ran…