Solving the Traffic and Flitter Challenges with Tulip - Archive ouverte HAL
Communication Dans Un Congrès Année : 2009

Solving the Traffic and Flitter Challenges with Tulip

Résumé

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.
Fichier principal
Vignette du fichier
Vast09.pdf (807.58 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00413602 , version 1 (04-09-2009)

Identifiants

  • HAL Id : hal-00413602 , version 1

Citer

Paolo Simonetto, Pierre-Yves Koenig, Faraz Zaidi, Daniel Archambault, Frédéric Gilbert, et al.. Solving the Traffic and Flitter Challenges with Tulip. IEEE Symposium on Visual Analytics Science and Technology 2009, Oct 2009, Atlantic City, New Jersey, USA, United States. pp.247-248. ⟨hal-00413602⟩
194 Consultations
211 Téléchargements

Partager

More