Haokun Li

Orcid: 0000-0001-6411-9324

According to our database1, Haokun Li authored at least 18 papers between 2018 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
Isolating all the real roots of a mixed trigonometric-polynomial.
J. Symb. Comput., March, 2024

M2DA: Multi-Modal Fusion Transformer Incorporating Driver Attention for Autonomous Driving.
CoRR, 2024

CodeFuse-Query: A Data-Centric Static Code Analysis System for Large-Scale Organizations.
CoRR, 2024

2023
Square-Free Pure Triangular Decomposition of Zero-Dimensional Polynomial Systems.
J. Syst. Sci. Complex., December, 2023

Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure.
J. Symb. Comput., 2023

Isolating Bounded and Unbounded Real Roots of a Mixed Trigonometric-Polynomial.
CoRR, 2023

A Generalized Extended MIMO Array Design Strategy for DOA Estimation.
Proceedings of the IEEE International Conference on Signal Processing, 2023

Local Search for Solving Satisfiability of Polynomial Formulas.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
Boost Test-Time Performance with Closed-Loop Inference.
CoRR, 2022

Square-free Strong Triangular Decomposition of Zero-dimensional Polynomial Systems.
CoRR, 2022

Downscaling and Overflow-aware Model Compression for Efficient Vision Processors.
Proceedings of the 42nd IEEE International Conference on Distributed Computing Systems, 2022

Towards Accurate Facial Motion Retargeting with Identity-Consistent and Expression-Exclusive Constraints.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Choosing the Variable Ordering for Cylindrical Algebraic Decomposition via Exploiting Chordal Structure.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020
Solving Satisfiability of Polynomial Formulas By Sample-Cell Projection.
CoRR, 2020

Generative Low-Bitwidth Data Free Quantization.
Proceedings of the Computer Vision - ECCV 2020, 2020

2019
A New Sparse SOS Decomposition Algorithm Based on Term Sparsity.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
Block SOS Decomposition.
CoRR, 2018

Monitoring CTMCs by Multi-clock Timed Automata.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018


  Loading...