Xiaohan Cheng

16 papers Journal 15Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Compatible powers of Hamilton cycles in dense graphs.
J. Graph Theory
Xiaohan Cheng, Jie Hu, Donglei Yang
2024 J jnl
Algorithm Research of ELMo Word Embedding and Deep Learning Multimodal Transformer in Image Description.
CoRR
Xiaohan Cheng, Taiyuan Mei, Yun Zi, Qi Wang, Zijun Gao, Haowei Yang
2024 J jnl
An Enhanced Encoder-Decoder Network Architecture for Reducing Information Loss in Image Semantic Segmentation.
CoRR
Zijun Gao, Qi Wang, Taiyuan Mei, Xiaohan Cheng, Yun Zi, Haowei Yang
2024 J jnl
Efficiency optimization of large-scale language models based on deep learning in natural language processing tasks.
CoRR
Taiyuan Mei, Yun Zi, Xiaohan Cheng, Zijun Gao, Qi Wang, Haowei Yang
2024 — conf
Enhancing Convolutional Neural Networks with Higher-Order Numerical Difference Methods.
ICBASE
Qi Wang, Zijun Gao, Mingxiu Sui, Taiyuan Mei, Xiaohan Cheng, Iris Li
2024 J jnl
Enhancing Convolutional Neural Networks with Higher-Order Numerical Difference Methods.
CoRR
Qi Wang, Zijun Gao, Mingxiu Sui, Taiyuan Mei, Xiaohan Cheng, Iris Li
2023 J jnl
Time integration schemes based on neural networks for solving partial differential equations on coarse grids.
CoRR
Xinxin Yan, Zhideng Zhou, Xiaohan Cheng, Xiaolei Yang
2022 J jnl
The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11.
Discret. Appl. Math.
Xiaohan Cheng, Bin Wang, Jihui Wang
2020 J jnl
Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs.
Discret. Math.
Xiaohan Cheng, Laihao Ding, Guanghui Wang, Jianliang Wu
2020 J jnl
Obtain Employee Turnover Rate and Optimal Reduction Strategy Based On Neural Network and Reinforcement Learning.
CoRR
Xiaohan Cheng
2019 J jnl
A Fourth Order Entropy Stable Scheme for Hyperbolic Conservation Laws.
Entropy
Xiaohan Cheng
2019 J jnl
A sixth-order finite difference WENO scheme for Hamilton-Jacobi equations.
Int. J. Comput. Math.
Xiaohan Cheng, Jian-Hu Feng
2018 J jnl
The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven.
J. Comb. Optim.
Xiaohan Cheng, Jianliang Wu
2017 J jnl
The adjacent vertex distinguishing total chromatic numbers of planar graphs Δ = 10.
J. Comb. Optim.
Xiaohan Cheng, Guanghui Wang, Jianliang Wu
2017 J jnl
The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles.
J. Comb. Optim.
Lin Sun, Xiaohan Cheng, Jianliang Wu
2015 J jnl
Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ.
Discret. Appl. Math.
Xiaohan Cheng, Danjun Huang, Guanghui Wang, Jian-Liang Wu