Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Alexandre Blondin-Massé"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 9, Iss 1 (2007)
For certain generalized Thue-Morse words t, we compute the critical exponent, i.e., the supremum of the set of rational numbers that are exponents of powers in t, and determine exactly the occurrences of powers realizing it.
Externí odkaz:
https://doaj.org/article/6b4455befe8a4703b85014e2de2fa2f4
We present recursive formulas giving the maximal number of leaves in tree-like polyforms living in two-dimensional regular lattices and in tree-like polycubes in the three-dimensional cubic lattice. We call these tree-like polyforms and polycubes \em
Externí odkaz:
http://arxiv.org/abs/1803.09181
Autor:
Maja Krajinovic, Daniel Sinnett, Mickael Wajnberg, Emile Levy, Caroline Laverdière, Abderrahim Benmoussa, Alexandre Blondin Massé, Valérie Marcil, Petko Valtchev
Publikováno v:
ICDM (Workshops)
To gain an in-depth understanding of human diseases, biologists typically mine patient data for relevant patterns. Clinical datasets are often unlabeled and involve features, a.k.a. markers, split into classes w.r.t. biological functions, whereby tar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08ce81e991641f7ae24c545ff3e71a5b
https://doi.org/10.1109/icdmw51313.2020.00085
https://doi.org/10.1109/icdmw51313.2020.00085
Publikováno v:
International Journal of Foundations of Computer Science. 29:701-704
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::099d4ded7ce9d04ec12defce061d9c2a
https://doi.org/10.1142/s0129054118020033
https://doi.org/10.1142/s0129054118020033
Autor:
Éric Marcotte, Alexandre Blondin Massé
Publikováno v:
Electronic Notes in Discrete Mathematics. 59:165-176
In 2009, Brlek, Koskas and Provencal proposed a data structure allowing self-intersection detection of discrete paths in linear time and space in the worst case. However, their ideas do not apply in a straightforward manner to arbitrary lattices. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::209d98f57f25dee7db84e04a9e07c643
https://doi.org/10.1016/j.endm.2017.05.012
https://doi.org/10.1016/j.endm.2017.05.012
Publikováno v:
K-CAP
International audience; To make knowledge-supported decisions, industrial actors often need to examine available data for suggestive patterns. As industrial data are typically unlabeled and involve multiple object types, unsupervised multi-relational
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24f8a13c06f075cee116e43e55456eaa
https://doi.org/10.1145/3360901.3364446
https://doi.org/10.1145/3360901.3364446
Publikováno v:
GC
In graph theory, the question of fully leafed induced subtrees has recently been investigated by Blondin Masse et al. in regular tilings of the Euclidian plane and 3-dimensional space. The function L_G that gives the maximum number of leaves of an in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22766e5d924502cc9cc154c46fa525a7
https://doi.org/10.1109/gc46384.2019.00014
https://doi.org/10.1109/gc46384.2019.00014
Autor:
Stevan Harnad, Marcos Lopes, Philippe Vincent-Lamarre, Alexandre Blondin Massé, Odile Marcotte, Mélanie Lord
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
How many words (and which ones) are sufficient to define all other words? When dictionaries are analyzed as directed graphs with links from defining words to defined words, they reveal a latent structure. Recursively removing all words that are reach
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c08ba78157ff1eb1b283cf1e1b10eaf
https://doi.org/10.1111/tops.12211
https://doi.org/10.1111/tops.12211
Publikováno v:
Theoretical Computer Science. 624:121-135
We present linear time and space operations on discrete paths. First, we compute the outer hull of any discrete path. As a consequence, a linear time and space algorithm is obtained for computing the convex hull. Next, we provide a linear algorithm c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1420b5e20a2735b41dd9c02daccc6b70
https://doi.org/10.1016/j.tcs.2015.07.033
https://doi.org/10.1016/j.tcs.2015.07.033
Autor:
Louise Tyvaert, Mario Lezoche, Mickael Wajnberg, Alexandre Blondin-Massé, Petko Valchev, Hervé Panetto
Publikováno v:
16th IFAC Symposium on Information Control Problems in Manufacturing, INCOM 2018
16th IFAC Symposium on Information Control Problems in Manufacturing, INCOM 2018, Jun 2018, Bergamo, Italy. pp.1397-1402, ⟨10.1016/j.ifacol.2018.08.330⟩
16th IFAC Symposium on Information Control Problems in Manufacturing, INCOM 2018, Jun 2018, Bergamo, Italy. pp.1397-1402, ⟨10.1016/j.ifacol.2018.08.330⟩
International audience; Interoperability is a major stake for industry, and in general for all the systems, of any dimension, that need to share contents in every shape. It provides that the exchanges between different parts of different entities per
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b774006399149ab492366230c33e6c18
https://hal.archives-ouvertes.fr/hal-01813398
https://hal.archives-ouvertes.fr/hal-01813398