Jun Liang

Orcid: 0000-0003-0034-2601

Affiliations:
  • South China Normal University, Foshan, China


According to our database1, Jun Liang authored at least 17 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Cyclic edge and cyclic vertex connectivity of (4,5,6)-fullerene graphs.
Discret. Appl. Math., 2024

Unpaired Multi-scenario Sketch Synthesis via Texture Enhancement.
Proceedings of the Pattern Recognition and Computer Vision - 7th Chinese Conference, 2024

Periodic Iterative Segmentation-Colorization Training: Line Drawing Colorization Using Text Tag with CBAMCat.
Proceedings of the Pattern Recognition and Computer Vision - 7th Chinese Conference, 2024

2023
Deep supervised hashing with hard example pairs optimization for image retrieval.
Vis. Comput., November, 2023

2022
A stroke image recognition model based on 3D residual network and attention mechanism.
J. Intell. Fuzzy Syst., 2022

A multi-scale semantic attention representation for multi-label image recognition with graph networks.
Neurocomputing, 2022

2021
Sketch works ranking based on improved transfer learning model.
Multim. Tools Appl., 2021

The cubic graphs with finite cyclic vertex connectivity larger than girth.
Discret. Math., 2021

Hard Example Guided Hashing for Image Retrieval.
CoRR, 2021

An Improved Chinese Text Classification Ensemble Model.
Proceedings of the ICDSP 2021: 5th International Conference on Digital Signal Processing, 2021

2020
Characterization of <i>k</i>-subconnected graphs.
Appl. Math. Comput., 2020

Distributed Algorithms for Cyclic Edge Connectivity and Cyclic Vertex Connectivity of Cubic Graphs.
Proceedings of the ICDSP 2020: 4th International Conference on Digital Signal Processing, 2020

2019
A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs.
J. Comb. Optim., 2019

A polynomial algorithm determining cyclic vertex connectivity of k-regular graphs with fixed k.
J. Comb. Optim., 2019

An Improved Algorithm based on KNN and Random Forest.
Proceedings of the 3rd International Conference on Computer Science and Application Engineering, 2019

2018
An ensemble method.
Proceedings of the 4th International Conference on Communication and Information Processing, 2018

2017
A polynomial time algorithm for cyclic vertex connectivity of cubic graphs.
Int. J. Comput. Math., 2017


  Loading...