Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Cédric Miachon"'
Publikováno v:
Social Network Analysis and Mining
Social Network Analysis and Mining, Springer, In press
Social Network Analysis and Mining, Springer, In press
International audience; A temporal graph G is a sequence of static graphs indexed by a set of integers representing time instants. Given ∆ an integer, a ∆-module is a set of vertices A having the same neighbourhood outside of A for ∆ consecutiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2bd9aea0c32138e9cea34c9c226b3aca
https://hal.archives-ouvertes.fr/hal-03431380/file/BHM21.pdf
https://hal.archives-ouvertes.fr/hal-03431380/file/BHM21.pdf
Publikováno v:
9th International Conference on Complex Networks and their Applications
Complex Networks 2020
Complex Networks 2020, Dec 2020, Madrid, Spain
Studies in Computational Intelligence ISBN: 9783030653507
COMPLEX NETWORKS (2)
Complex Networks 2020
Complex Networks 2020, Dec 2020, Madrid, Spain
Studies in Computational Intelligence ISBN: 9783030653507
COMPLEX NETWORKS (2)
A temporal graph \(\mathcal {G}\) is a sequence of static graphs indexed by a set of integers T representing time instants. For \(\varDelta \) an integer, a pair of \(\varDelta \)-twins is a pair of vertices \(u\ne v\) which, starting at some time in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11388af079d817c58a70a1605901dc06
https://hal.archives-ouvertes.fr/hal-02997890
https://hal.archives-ouvertes.fr/hal-02997890
Publikováno v:
PPDP '08: Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
PPDP: ACM SIGPLAN Conference on Principles and practice of declarative programming
PPDP: ACM SIGPLAN Conference on Principles and practice of declarative programming, 2008, Spain. pp.131-142, ⟨10.1145/1389449.1389466⟩
PPDP
HAL
Actes des 23èmes Journées Bases de Données Avancées
23èmes Journées Bases de Données Avancées
23èmes Journées Bases de Données Avancées, Oct 2007, France
PPDP: ACM SIGPLAN Conference on Principles and practice of declarative programming
PPDP: ACM SIGPLAN Conference on Principles and practice of declarative programming, 2008, Spain. pp.131-142, ⟨10.1145/1389449.1389466⟩
PPDP
HAL
Actes des 23èmes Journées Bases de Données Avancées
23èmes Journées Bases de Données Avancées
23èmes Journées Bases de Données Avancées, Oct 2007, France
We present Pattern-by-Example (PBE), a graphical language that allows users with little or no knowledge of pattern-matching and functional programming to define complex and optimized queries on XML documents. We demonstrate the key features of PBE by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1eac07dc4fcb877f9f0dd7dbba74db5b
https://hal.archives-ouvertes.fr/hal-00336118
https://hal.archives-ouvertes.fr/hal-00336118
Publikováno v:
PADL 05, 7th International Symposium on Practical Aspects of Declarative Languages
Practical Aspects of Declarative Languages ISBN: 9783540243625
PADL
HAL
Practical Aspects of Declarative Languages ISBN: 9783540243625
PADL
HAL
In this article we investigate a novel execution paradigm – ML-like pattern-matching – for XML query processing. We show that such a paradigm is well adapted for a common and frequent set of queries and advocate that it constitutes a candidate fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8bf70426854818c6b5277fc549fe9053
https://hal.science/hal-00152591
https://hal.science/hal-00152591