 |
|
|
|
| HAL : hal-00413602, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
| IEEE Symposium on Visual Analytics Science and Technology 2009, Atlantic City, New Jersey, USA : États-Unis (2009) |
|
|
|
|
| Solving the Traffic and Flitter Challenges with Tulip |
|
|
Paolo Simonetto 1, 2Pierre-Yves Koenig 1, 2 |
|
|
| Gravité Collaboration(s) |
|
|
| (12/10/2009) |
|
|
|
| We present our visualization systems and findings for the Badge and Network Traffic as well as the Social Network and Geospatial challenges of the 2009 VAST contest. The summary starts by presenting an overview of our time series encoding of badge information and network traffic. Our findings suggest that employee 30 may be of interest. In the second part of the paper, we describe our system for finding subgraphs in the social network subject to degree constraints. Subsequently, we present our most likely candidate network which is similar to scenario B. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire Bordelais de Recherche en Informatique (LaBRI) |
|
|
|
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II |
|
|
| 2 : | GRAVITE (INRIA Bordeaux - Sud-Ouest) |
|
|
|
INRIA – CNRS : UMR – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Recherche d'information |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00413602, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00413602 | |
| oai:hal.archives-ouvertes.fr:hal-00413602 | |
| Contributeur : Paolo Simonetto | |
| Soumis le : Vendredi 4 Septembre 2009, 15:19:11 | |
| Dernière modification le : Mercredi 27 Janvier 2010, 23:48:40 | |
