Mathieu Couture

Publication List Details

Period

2005 - 2008

Number

19

Co-Authors

ALGORITHMS FOR OPTIMAL OUTLIER REMOVAL ∗ (2008)

Rossen Atanassov, Prosenjit Bose, Mathieu Couture, Anil Maheshwari, Pat Morin, Michel Paquette, ...

Abstract. We consider the problem of removing c points from a set S of n points so that the remaining point set is optimal in some sense. Definitions of optimality we consider include having minimum...

Spanners of Additively Weighted Point Sets (2008)

Bose, Prosenjit, Carmi, Paz, Couture, Mathieu

We study the problem of computing geometric spanners for (additively) weighted point sets. A weighted point set is a set of pairs $(p,r)$ where $p$ is a point in the plane and $r$ is a real number....

Spanners of Additively Weighted Point Sets ∗ Prosenjit Bose Paz Carmi (2008)

Mathieu Couture

We study the problem of computing geometric spanners for (additively) weighted point sets. A weighted point set is a set of pairs (p, r) where p is a point in the plane and r is a real number. The...

Spanners of Complete $k$-Partite Geometric Graphs (2007)

Bose, Prosenjit, Carmi, Paz, Couture, Mathieu, Maheshwari, Anil, Morin, Pat, Smid, Michiel

We address the following problem: Given a complete $k$-partite geometric graph $K$ whose vertex set is a set of $n$ points in $\mathbb{R}^d$, compute a spanner of $K$ that has a ``small'' stretch...

Geometric Spanners With Small Chromatic Number (2007)

Bose, Prosenjit, Carmi, Paz, Couture, Mathieu, Maheshwari, Anil, Smid, Michiel, Zeh, Norbert

Given an integer $k \geq 2$, we consider the problem of computing the smallest real number $t(k)$ such that for each set $P$ of points in the plane, there exists a $t(k)$-spanner for $P$ that has...

On a family of strong geometric spanners that admit local routing strategies (2007)

Bose, Prosenjit, Carmi, Paz, Couture, Mathieu, Smid, Michiel, Xu, Daming

We introduce a family of directed geometric graphs, denoted $\paz$, that depend on two parameters $\lambda$ and $\theta$. For $0\leq \theta

Geometric spanners with small chromatic number (2007)

Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel Smid, Norbert Zeh

Abstract. Given an integer k ≥ 2, we consider the problem of computing the smallest real number t(k) such that for each set P of points in the plane, there exists a t(k)-spanner for P that has...

routing strategies (2007)

Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel Smid, Daming Xu

a family of strong geometric spanners that admit local

Incremental Construction of k-Dominating Sets in Wireless Sensor Networks (2006)

Mathieu Couture, Michel Barbeau, Prosenjit Bose, Evangelos Kranakis

Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new incremental local...

Détection d'intrusions et analyse passive de réseaux (2005)

Couture, Mathieu

Dans ce travail, nous proposons un nouveau langage dédié à la détection d'intrusions. Il s'agit d'un langage purement déclaratif, basé sur une logique temporelle linéaire passée avec...

Détection d'intrusions et analyse passive de réseaux (2005)

Couture, Mathieu

Dans ce travail, nous proposons un nouveau langage dédié à la détection d'intrusions. Il s'agit d'un langage purement déclaratif, basé sur une logique temporelle linéaire passée avec...

Détection d'intrusions et analyse passive de réseaux (2005)

Couture, Mathieu

Dans ce travail, nous proposons un nouveau langage dédié à la détection d'intrusions. Il s'agit d'un langage purement déclaratif, basé sur une logique temporelle linéaire passée avec...

Détection d'intrusions et analyse passive de réseaux (2005)

Couture, Mathieu

Dans ce travail, nous proposons un nouveau langage dédié à la détection d'intrusions. Il s'agit d'un langage purement déclaratif, basé sur une logique temporelle linéaire passée avec...

Détection d'intrusions et analyse passive de réseaux [ressource électronique] / (2005)

Couture, Mathieu.

Dans ce travail, nous proposons un nouveau langage dédié à la détection d'intrusions. Il s'agit d'un langage purement déclaratif, basé sur une logique temporelle linéaire passée avec...

Context-Based Intrusion Detection Using Snort, Nessus and Bugtraq Databases (2005)

Frederic Massicotte, Mathieu Couture, Lionel Bri, Yvan Labiche

Intrusion Detection Systems (IDS) use di#erent techniques to reduce the number of false positives they generate. Simple network context information such as the communication session state has been...

Using a VMware Network Infrastructure to Collect Traffic Traces for Intrusion Detection Evaluation (2005)

Frederic Massicotte, Mathieu Couture

this report, some recommendations for IDS Testing Research are made. Among those recommendations, the authors insist that data sets should contain realistic data and be shared freely between multiple...