Dao, Vinh-Loc Bothorel, Cécile Lenca, Philippe
Published in
Social Network Analysis and Mining

Community detection emerges as an important task in the discovery of network mesoscopic structures. However, the concept of a “good” community is very context-dependent, and it is relatively complicated to deduce community characteristics using available community detection techniques. In reality, the existence of a gap between structural goodness ...

Foucaud, Florent Hocquard, Hervé Lajou, Dimitri

An injective $k$-edge-coloring of a graph $G$ is an assignment of colors, i.e. integers in $\{1, \ldots , k\}$, to the edges of $G$ such that any two edges each incident with one distinct endpoint of a third edge, receive distinct colors. The problem of determining whether such a $k$-coloring exists is called k-INJECTIVE EDGE-COLORING. We show that...

Allassonnière, Stéphanie Chevallier, Juliette

The expectation-maximization (EM) algorithm is a powerful computational technique for maximum likelihood estimation in incomplete data models. When the expectation step cannot be performed in closed form, a stochastic approximation of EM (SAEM) can be used. The convergence of the SAEM toward local maxima of the observed likelihood has been proved a...

Rouillard, Louis Wassermann, Demian

Frequently, population studies feature pyramidally-organized data represented using Hierarchical Bayesian Models (HBM) enriched with plates. These models can become prohibitively large in settings such as neuroimaging, where a sample is composed of a functional MRI signal measured on 64 thousand brain locations, across 4 measurement sessions, and a...

Anceaume, Emmanuelle Busnel, Yann Sericola, Bruno

We consider the problem of achieving uniform node sampling in large scale systems in presence of Byzantine nodes. The uniform node sampling service offers to applications using it a single simple primitive that returns, upon invocation, the identifier of a random node that belongs to the system. We first propose an omniscient strategy that processe...

Boissonnat, Jean-Daniel Kachanovich, Siargey Wintraecken, Mathijs

Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. submanifolds of R d defined as the zero set of some multivariate multivalued smooth function $f : R^d → R^{d−n}$ , where n is the intrinsic dimension of the manifold. A natural way to approximate a smooth isomanifold M is to consider its Piecewise-Linear...

Raynal, Maxime Buob, Marc-Olivier Quénot, Georges

Le traitement de logs réseaux passe souvent par le regroupement d'alarmes similaires afin d'en faciliter l'analyse. Ce travail présente un algorithme de partitionnement basé sur une nouvelle distance d'édition. Alors que les distances d'édition usuelles comparent deux chaînes caractère par caractère, notre approche les compare à l'échelle du motif....

Sorba, Olivier Geissler, C

The aim of the present study is to detect abrupt trend changes in the mean of a multidimensional sequential signal. Directly inspired by papers of Fernhead and Liu ([4] and [5]), this work describes the signal in a hierarchical manner : the change dates of a time segmentation process trigger the renewal of a piece-wise constant emission law. Bayesi...

Wolf, Marc Wolf, François

Odd numbers can be indexed by the map k(n)=(n-3)/2, n belonging to 2N+3. We first propose a basic primality test using this index function that was first introduced in article (8). Input size of operations is reduced which improves computational time by a constant. We then apply similar techniques to Atkin prime-numbers sieve which uses modulus ope...

Henry, Jerome Busnel, Yann Ludinard, Romaric Montavont, Nicolas

802.11 Fine Timing Measurement is an indoor ranging technique. Because it is unauthenticated and unprotected, our experiments indicate that an adversary can implement ranging and location attacks, by inserting one or more rogue responders and causing an unsuspecting client to incorporate forged values into its location computation. FTM clients tend...