Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Massé, Alexandre Blondin"'
Autor:
Hamann, Hendrik F., Brunschwiler, Thomas, Gjorgiev, Blazhe, Martins, Leonardo S. A., Puech, Alban, Varbella, Anna, Weiss, Jonas, Bernabe-Moreno, Juan, Massé, Alexandre Blondin, Choi, Seong, Foster, Ian, Hodge, Bri-Mathias, Jain, Rishabh, Kim, Kibaek, Mai, Vincent, Mirallès, François, De Montigny, Martin, Ramos-Leaños, Octavio, Suprême, Hussein, Xie, Le, Youssef, El-Nasser S., Zinflou, Arnaud, Belvi, Alexander J., Bessa, Ricardo J., Bhattari, Bishnu Prasad, Schmude, Johannes, Sobolevsky, Stanislav
Foundation models (FMs) currently dominate news headlines. They employ advanced deep learning architectures to extract structural information autonomously from vast datasets through self-supervision. The resulting rich representations of complex syst
Externí odkaz:
http://arxiv.org/abs/2407.09434
Publikováno v:
EPTCS 403, 2024, pp. 6-11
In graph theory, the minimum directed feedback vertex set (FVS) problem consists in identifying the smallest subsets of vertices in a directed graph whose deletion renders the directed graph acyclic. Although being known as NP-hard since 1972, this p
Externí odkaz:
http://arxiv.org/abs/2406.16390
Autor:
Besner, Alexandre, Massé, Alexandre Blondin, Bani, Abderrahman, Morabit, Mouad, Charest, Luc, Ialongo, David, Couture-Gagnon, Simon, Fournier, Julien
Hydro-Quebec (HQ) is a vertically integrated utility that produces, transmits, and distributes most of the electricity in the province of Quebec. The power grid it operates has a particular architecture created by large hydroelectric dams located far
Externí odkaz:
http://arxiv.org/abs/2405.20199
We study a graph-theoretic problem in the Penrose P2-graphs which are the dual graphs of Penrose tilings by kites and darts. Using substitutions, local isomorphism and other properties of Penrose tilings, we construct a family of arbitrarily large in
Externí odkaz:
http://arxiv.org/abs/2312.08262
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence, 38(21), 23508-23509,2024
In the last years, several variants of transformers have emerged. In this paper, we compare different transformer-based models for solving the reverse dictionary task and explore their use in the context of a serious game called The Dictionary Game.
Externí odkaz:
http://arxiv.org/abs/2311.02985
Autor:
Massé, Alexandre Blondin, de Carufel, Julien, Goupil, Alain, Lapointe, Mélodie, Nadeau, Émile, Vandomme, Élise
Given a simple graph $G$ with $n$ vertices and a natural number $i \leq n$, let $L_G(i)$ be the maximum number of leaves that can be realized by an induced subtree $T$ of $G$ with $i$ vertices. We introduce a problem that we call the \emph{leaf reali
Externí odkaz:
http://arxiv.org/abs/1712.01942
Autor:
Massé, Alexandre Blondin, de Carufel, Julien, Goupil, Alain, Lapointe, Mélodie, Nadeau, Émile, Vandomme, Élise
Let $G$ be a simple graph on $n$ vertices. We consider the problem LIS of deciding whether there exists an induced subtree with exactly $i \leq n$ vertices and $\ell$ leaves in $G$. We study the associated optimization problem, that consists in compu
Externí odkaz:
http://arxiv.org/abs/1709.09808
Autor:
Vincent-Lamarre, Philippe, Massé, Alexandre Blondin, Lopes, Marcos, Lord, Mélanie, Marcotte, Odile, Harnad, Stevan
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:
http://arxiv.org/abs/1411.0129
The object under study is a particular closed curve on the square lattice $\Z^2$ related with the Fibonacci sequence $F_n$. It belongs to a class of curves whose length is $4F_{3n+1}$, and whose interiors by translation tile the plane. The limit obje
Externí odkaz:
http://arxiv.org/abs/1103.6171
Autor:
Vincent‐Lamarre, Philippe1,2, Massé, Alexandre Blondin3, Lopes, Marcos4, Lord, Mélanie3, Marcotte, Odile3, Harnad, Stevan1,5
Publikováno v:
Topics in Cognitive Science. Jul2016, Vol. 8 Issue 3, p625-659. 35p.