Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Ma Kejie"'
Autor:
Wang, Siqi, Yang, Hailong, Wang, Xuezhu, Liu, Tongxuan, Wang, Pengbo, Liang, Xuning, Ma, Kejie, Feng, Tianyu, You, Xin, Bao, Yongjun, Liu, Yi, Luan, Zhongzhi, Qian, Depei
Large language models (LLM) have recently attracted surging interest due to their outstanding capabilities across various domains. However, enabling efficient LLM inference is challenging due to its autoregressive decoding that generates tokens only
Externí odkaz:
http://arxiv.org/abs/2402.15678
Publikováno v:
Acta Mathematicae Applicatae Sinica. 15:396-400
LetG be a graph with $$\left( {\mathop {n + 1}\limits_2 } \right)$$ edges. We sayG has an Ascending Subgraph Decomposition (ASD) if the edge set ofG can be partitioned inton sets generating graphsG 1,G 2,...,G n such that |E(G i)|=i (fori=1,2...,n) a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b79726737d3fee7838290666dd1d89a6
https://doi.org/10.1007/bf02684040
https://doi.org/10.1007/bf02684040
Autor:
Chen Huaitang, Ma Kejie
Publikováno v:
Applied Mathematics-A Journal of Chinese Universities. 13:165-170
The definition of the ascending subgraph decomposition was given by Alavi. It has been conjectured that every graph of positive size has an ascending subgraph decomposition. In this paper it is proved that the regular graphs under some conditions do
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27a2deac0a201294a910e69ab12ed953
https://doi.org/10.1007/s11766-998-0037-z
https://doi.org/10.1007/s11766-998-0037-z
Publikováno v:
Combinatorica; Sep1994, Vol. 14 Issue 3, p307-320, 14p