Lingji Xu

Orcid: 0009-0008-4971-932X

According to our database1, Lingji Xu authored at least 18 papers between 2013 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
A Row-Sparse Tensor Decomposition-Based Approach for Fading Channel Prediction.
IEEE Wirel. Commun. Lett., 2026

Physics-driven environmental augmentation for underwater acoustic target recognition.
Signal Process., 2026

Dual-prompt-based binary matching for open set domain adaptation.
Neurocomputing, 2026

Lightweight modulation recognition of underwater acoustic communication signals.
Digit. Signal Process., 2026

2025
Fast Time-Varying Sparsity Exploitation With Adaptive Observation Length Strategies in Underwater Acoustic Communication.
IEEE Trans. Aerosp. Electron. Syst., December, 2025

Exploiting Time-Varying Sparsity for Underwater Acoustic Communication Under Delay and Doppler Spreading Channel.
IEEE Internet Things J., 2025

2024
Multiple synchro-tuning chirplet transform.
Digit. Signal Process., January, 2024

2023
Enhancing time-frequency resolution via deep-learning framework.
IET Signal Process., April, 2023

1-Bit Hilbert Transform for Signed Signals with Sparse Prior.
Circuits Syst. Signal Process., March, 2023

Combining Synchrosqueezing Transform and Encoder-Decoder Classification Network for Modulation Recognition of Underwater Acoustic Communication Signals.
Proceedings of the IEEE International Conference on Signal Processing, 2023

Deep Learning Based DOA Estimation with Single Vector Hydrophone in Shallow Water.
Proceedings of the IEEE International Conference on Signal Processing, 2023

2020
Automatic Design of Compliant Surgical Forceps With Adaptive Grasping Functions.
IEEE Robotics Autom. Lett., 2020

Automatic synthesis of compliant forceps for robot-assisted minimally invasive surgery.
Autom., 2020

2019
Design of a Disposable Compliant Medical Forceps using Topology Optimization Techniques.
Proceedings of the 2019 IEEE International Conference on Robotics and Biomimetics, 2019

2014
Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable.
J. Comb. Optim., 2014

2013
Improper Choosability of Planar Graphs without 4-Cycles.
SIAM J. Discret. Math., 2013

Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorable.
Discret. Math., 2013

A sufficient condition for a plane graph with maximum degree 6 to be class 1.
Discret. Appl. Math., 2013


  Loading...