Results 211 to 220 of about 54,820 (267)
GlycanGT: a pretrained graph transformer framework for glycan graph representation and generative learning. [PDF]
BioinformaticsKitani A, Zhang B, Himori K, Matsui Y.
europepmc +1 more source
Native sparse attention: co-designing algorithms and hardware for practical long-context efficiency. [PDF]
Natl Sci RevYuan J, Zhang M.
europepmc +1 more source
Graphs and Combinatorics, 2011 For a graph $G$ and integer $k\geq1$, we define the token graph $F_k(G)$ to be the graph with vertex set all $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever their symmetric difference is a pair of adjacent vertices in $G$.
Clemens Huemer +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2020
The authors have carried out an examination of the status of tokens and tokenization in financial markets with regulatory problems, which lack proposals for solutions based on a generalized consensus. Overall, it seems to authors that cutting the Gordian knot of tokenization and tokens is the essential need to achieve a consensual and efficient ...
Carlos Fernandez-Herraiz +2 more
openaire +1 more source
The authors have carried out an examination of the status of tokens and tokenization in financial markets with regulatory problems, which lack proposals for solutions based on a generalized consensus. Overall, it seems to authors that cutting the Gordian knot of tokenization and tokens is the essential need to achieve a consensual and efficient ...
Carlos Fernandez-Herraiz +2 more
openaire +1 more source
International Journal of Computer Mathematics: Computer Systems Theory, 2021
We investigate a new variation of a token reconfiguration problem on graphs using the cyclic shift operation. A colored or labeled token is placed on each vertex of a given graph, and a “move” consists in choosing a cycle in the graph and shifting tokens by one position along its edges.
Win Hlaing Hlaing Myint +2 more
openaire +1 more source
We investigate a new variation of a token reconfiguration problem on graphs using the cyclic shift operation. A colored or labeled token is placed on each vertex of a given graph, and a “move” consists in choosing a cycle in the graph and shifting tokens by one position along its edges.
Win Hlaing Hlaing Myint +2 more
openaire +1 more source