Xirong Xu

Orcid: 0000-0002-7558-3031

According to our database1, Xirong Xu authored at least 51 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Reinforcement learning from constraints and focal entity shifting in conversational KGQA.
Neural Comput. Appl., February, 2024

2023
Multi-task Label-wise Transformer for Chinese Named Entity Recognition.
ACM Trans. Asian Low Resour. Lang. Inf. Process., April, 2023

A More Robust Model to Answer Noisy Questions in KBQA.
IEEE Access, 2023

Root cause and fault propagation analysis based on causal graph in chemical processes.
Proceedings of the CAA Symposium on Fault Detection, 2023

2022
SSMFRP: Semantic Similarity Model for Relation Prediction in KBQA Based on Pre-trained Models.
Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2022, 2022

2021
(n - 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn.
Int. J. Found. Comput. Sci., 2021

2019
Fault-Tolerant Panconnectivity of Augmented Cubes AQn.
Int. J. Found. Comput. Sci., 2019

Fault-Tolerant Path-Embedding of Twisted Hypercube-Like Networks THLNs.
CoRR, 2019

Classification of Spectrum Images of Solar Radio Bursts Based on Deep Learning.
Proceedings of the 15th International Conference on Computational Intelligence and Security, 2019

2018
The crossing number of locally twisted cubes LTQn.
Discret. Appl. Math., 2018

The Feedback Number of Knodel graph W3, n.
Ars Comb., 2018

Fault-Tolerant Hamiltonian Connectivity of Twisted Hypercube-Like Networks THLNs.
IEEE Access, 2018

Fault-Tolerant Edge-Pancyclicity of Möbius Cube MQ_n.
Proceedings of the IEEE International Conference on Parallel & Distributed Processing with Applications, 2018

2017
改进的自适应谱聚类NJW算法 (Improved Adaptive Spectral Clustering NJW Algorithm).
计算机科学, 2017

The crossing number of pancake graph P<sub>4</sub> is six.
Ars Comb., 2017

An upper bound for the crossing number of locally twisted cubes.
Ars Comb., 2017

Decycling Number of Crossed Cubes CQn.
Proceedings of the 13th International Conference on Computational Intelligence and Security, 2017

2016
广义Kautz有向图GK(3, n)的反馈数的界 (Feedback Numbers of Generalized Kautz Digraphs GK(3, n)).
计算机科学, 2016

Fault-tolerant vertex-pancyclicity of locally twisted cubes LTQ<sub>n</sub>.
J. Parallel Distributed Comput., 2016

2015
Decycling bubble sort graphs.
Discret. Appl. Math., 2015

The decycling number of generalized Petersen graphs.
Discret. Appl. Math., 2015

On the Domination Number of Generalized Petersen Graphs P(ck, k).
Ars Comb., 2015

2014
Erratum to: Some Graphs with Double Domination Subdivision Number Three.
Graphs Comb., 2014

Some Graphs with Double Domination Subdivision Number Three.
Graphs Comb., 2014

Feedback Number of Generalized Kautz Digraphs GK(2, n).
Ars Comb., 2014

A novel ensemble classifier based on multiple diverse classification methods.
Proceedings of the 11th International Conference on Fuzzy Systems and Knowledge Discovery, 2014

Improved Feedback Vertex Sets in Kautz Digraphs K (d, n).
Proceedings of the Tenth International Conference on Computational Intelligence and Security, 2014

2013
The crossing number of the generalized Petersen graph <i>P</i>(10, 3) is six.
Int. J. Comput. Math., 2013

Roman domination number of Generalized Petersen Graphs P(n, 2).
Ars Comb., 2013

2012
On the bounds of feedback numbers of (n, k)-star graphs.
Inf. Process. Lett., 2012

The crossing numbers of K<sub>m</sub> × P<sub>n</sub> and K<sub>m</sub> × C<sub>n</sub>
CoRR, 2012

The crossing number of the generalized Petersen graph P(10, 3) is six
CoRR, 2012

The crossing numbers of K<sub>n,n</sub> - nK<sub>2</sub>, K<sub>n</sub> × P<sub>2</sub>, K<sub>n</sub> × P<sub>3</sub> and K<sub>n</sub> × C<sub>4</sub>
CoRR, 2012

An upper bound for the crossing number of bubble-sort graph Bn
CoRR, 2012

Conditional Fault Diagnosis of Bubble Sort Graphs under the PMC Model
CoRR, 2012

Feedback numbers of Kautz undirected graphs.
Australas. J Comb., 2012

2011
On the distance paired domination of generalized Petersen graphs <i>P</i>(<i>n</i>, 1) and <i>P</i>(<i>n</i>, 2).
J. Comb. Optim., 2011

Fault-tolerant edge-pancyclicity of locally twisted cubes.
Inf. Sci., 2011

Radio number of ladder graphs.
Int. J. Comput. Math., 2011

DBS analysis of Chinese noun phrases.
Proceedings of the 7th International Conference on Natural Language Processing and Knowledge Engineering, 2011

An Important Property about Vertex Distance of Crossed Cubes CQn.
Proceedings of the Seventh International Conference on Computational Intelligence and Security, 2011

2010
Feedback numbers of de Bruijn digraphs.
Comput. Math. Appl., 2010

2009
The Graphs C<sup>(t)</sup><sub>13</sub> are Graceful for t = 0, 3 (mod 4).
Ars Comb., 2009

On (a, d)-Antimagic Labelings of Generalized Petersen Graphs.
Ars Comb., 2009

On the Gracefulness of the Digraphs n-C<sub>m</sub>.
Ars Comb., 2009

2008
The Graphs C(t)11 are Graceful for t = 0, 1 (mod 4).
Ars Comb., 2008

2007
The Graphs C(t)9 are Graceful for t = 0, 3 (mod 4).
Ars Comb., 2007

Super Edge-Magic Labelings of Generalized Petersen Graphs P(n, 3).
Ars Comb., 2007

2006
The Graphs C(t)7 are Graceful for t = 0, 1, (mod 4).
Ars Comb., 2006

2005
An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)
CoRR, 2005

On Harmonious Labelings of the Balanced Quadruple Shells.
Ars Comb., 2005


  Loading...