# Gilles Caporossi

Back## Cahiers du GERAD

### 86 results — page 3 of 5

Finding communities, or clusters, in networks, or graphs, has been the subject of intense studies in the last ten years. The most used criterion for that pu...

BibTeX reference

In the last ten years, finding communities in networks, has been the subject of intense studies. If modularity maximization is still one of the mostly studi...

BibTeX reference

There are currently several systems to collect online writing data in keystroke logging. Each of these systems provides reliable and very precise data. Unf...

BibTeX reference

In this paper, we present an edge and vertex decomposition of the Wiener index (<i>W</i>) that is related to the concept of betweenness centrality used in so...

BibTeX reference

The decomposition of the movement of the eye into different categories is critical to their study. According to the algorithm used, some movements may signi...

BibTeX referenceReprésentation de la genèse d'un texte par un graphe

Les outils informatiques de capture en temps réel (Scriptlog, inputlog ou Eye and Pen) procurent des données d'une qualité inégalée (par les autres méthodes)...

BibTeX referenceExtensions to the Repetitive Branch and Bound Algorithm for Globally Optimal Clusterwise Regression

A branch and bound strategy is proposed for solving the clusterwise regression problem, extending Brusco's repetitive branch and bound algorithm (RBBA). The ...

BibTeX reference

Finding modules, or clusters, in networks currently attracts much attention in several domains. The most studied criterion for doing so, due to Newman and Gi...

BibTeX reference

Exact global optimization of the clusterwise regression problem is challenging and there are currently no published feasible methods for performing this clus...

BibTeX reference

This study investigated the influence of working memory capacity on the dynamics of text composition from source, notably the strategy used by writers to con...

BibTeX reference

This paper evaluates the changes in efficiency and productivity of coal-fired electricity generation of 30 Chinese administrative regions from 1999 to 2007. ...

BibTeX reference

In this work we develop new methods and algorithms for building networks with high synchronizability of dynamical processes occurring at their nodes. In addi...

BibTeX reference

The distance energy of a graph <i>G</i> is defined as <img src="/cgi-bin/mimetex.cgi?E*D(G) = \sum |\mu*i |">, where <img src="/cgi-bin/mimetex.cgi?\mu_i"> i...

A <i>k</i>-edge-coloring of a graph <i>G=(V,E)</i> is a function <i>c</i> that assigns an integer <i>c(e)</i> (called color) in <i>{0,1, ..., k-1}</i> to eve...

BibTeX reference

Given a graph <i>G=(V,E)</i>, the first Zagreb index <i>M</i><sub>1</sub> is the sum of its vertices squared degrees and the second Zagreb index <i>M</i><sub...

BibTeX reference

Necessary and sufficient conditions are provided for existence of a simple graph <i>G</i>, and for a simple and connected graph <i>G'</i> with given numbers ...

BibTeX reference

Based upon a robust optimization technique, Variable Neighborhood Search (VNS), we use simulation to find rules for identifying the correct Minkowski paramet...

BibTeX referencePerformance of n-Grams for a Question Retrieval System in the Context of Approximated Spelling

Question retrieval systems, unlike question answering systems, exploit the knowledge contained in previously answered questions to answer new ones by returni...

BibTeX reference

Clusterwise regression is a technique for clustering data. Instead of using the classical homogeneity or separation criterion, clusterwise regression is ba...

BibTeX reference

The AutoGraphiX system (AGX 1 and AGX 2) for interactive, and for several functions automated, graph theory, discovers conjectures of algebraic or structura...

BibTeX reference