Zobrazeno 1 - 10
of 124
pro vyhledávání: '"Melançon, Guy"'
Modelling relationships between entities in real-world systems with a simple graph is a standard approach. However, reality is better embraced as several interdependent subsystems (or layers). Recently the concept of a multilayer network model has em
Externí odkaz:
http://arxiv.org/abs/1902.06815
In this paper, we propose a new drag and drop interaction technique for graphs. We designed this interaction to support analysis in complex multidimensional and temporal graphs. The drag and drop interaction is enhanced with an intuitive and controll
Externí odkaz:
http://arxiv.org/abs/1902.01564
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
One of the most widely studied problem in mining and analysis of complex networks is the detection of community structures. The problem has been extensively studied by researchers due to its high utility and numerous applications in various domains.
Externí odkaz:
http://arxiv.org/abs/1607.08497
Publikováno v:
EPTCS 181, 2015, pp. 65-79
Numerous propagation models describing social influence in social networks can be found in the literature. This makes the choice of an appropriate model in a given situation difficult. Selecting the most relevant model requires the ability to objecti
Externí odkaz:
http://arxiv.org/abs/1504.02612
Publikováno v:
In Visual Informatics December 2020 4(4):23-34
Autor:
Ciorna, Vasile1,2,3 (AUTHOR) vasile.ciorna@u-bordeaux.fr, Melançon, Guy2,3 (AUTHOR), Petry, Frank1 (AUTHOR), Ghoniem, Mohammad4 (AUTHOR)
Publikováno v:
Information Visualization. Apr2024, Vol. 23 Issue 2, p123-141. 19p.
Publikováno v:
In Information Fusion May 2019 47:72-87
Autor:
Andrei, Oana, Fernández, Maribel, Kirchner, Hélène, Melançon, Guy, Namet, Olivier, Pinaud, Bruno
Publikováno v:
EPTCS 48, 2011, pp. 54-68
This paper investigates the use of graph rewriting systems as a modelling tool, and advocates the embedding of such systems in an interactive environment. One important application domain is the modelling of biochemical systems, where states are repr
Externí odkaz:
http://arxiv.org/abs/1102.2654
Autor:
Melancon, Guy, Philippe, Fabrice
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of a previous one, designed to generate acyclic digraphs, non necessarily
Externí odkaz:
http://arxiv.org/abs/cs/0403040