Mingfei Li

According to our database1, Mingfei Li authored at least 16 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An Algorithm for the Recognition of Motion-Blurred QR Codes Based on Generative Adversarial Networks and Attention Mechanisms.
Int. J. Comput. Intell. Syst., December, 2024

2023
SECS: An effective CNN joint construction strategy for breast cancer histopathological image classification.
J. King Saud Univ. Comput. Inf. Sci., February, 2023

Generalizing Graph Network Models for the Traveling Salesman Problem with Lin-Kernighan-Helsgaun Heuristics.
Proceedings of the Neural Information Processing - 30th International Conference, 2023

Trustworthy Dynamic Object Tracking Using Deep Reinforcement Learning with the Self-Attention Mechanism.
Proceedings of the 19th IEEE International Conference on Automation Science and Engineering, 2023

2021
Research on Temperature and Braking Performance of Water-Cooled Eddy Current Retarder.
IEEE Access, 2021

2017
Using SOMbrero to examine the economic convergence of European countries from 2001-2013.
Proceedings of the 12th International Workshop on Self-Organizing Maps and Learning Vector Quantization, 2017

Patient Satisfaction and Hospital Structure: How Are They Related?
Proceedings of the Smart Health - International Conference, 2017

2015
New Doubling Spanners: Better and Simpler.
SIAM J. Comput., 2015

Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree.
Algorithmica, 2015

2013
Sparse representation and fast processing of massive data.
PhD thesis, 2013

(1 + <i>ε</i>)-Distance Oracles for Vertex-Labeled Planar Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2013

2012
Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams.
IACR Cryptol. ePrint Arch., 2012

Incubators vs Zombies: Fault-Tolerant, Short, Thin and Lanky Spanners for Doubling Metrics
CoRR, 2012

2011
Oblivious RAM with O((log N)<sup>3</sup>) Worst-Case Cost.
IACR Cryptol. ePrint Arch., 2011

(1+epsilon)-Distance Oracle for Planar Labeled Graph
CoRR, 2011

Oblivious RAM with O((logN)3) Worst-Case Cost.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011


  Loading...