Ning Kang

Affiliations:
  • Huawei Noah's Ark Lab, Hong Kong, SAR, China
  • University of Hong Kong, SAR, China


According to our database1, Ning Kang authored at least 19 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Network Specification Mining with High Fidelity and Scalability.
Proceedings of the 31st IEEE International Conference on Network Protocols, 2023

DAMix: Exploiting Deep Autoregressive Model Zoo for Improving Lossless Compression Generalization.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
GMrepo v2: a curated human gut microbiome database with special focus on disease markers and cross-dataset comparison.
Nucleic Acids Res., 2022

Parallel Neural Local Lossless Compression.
CoRR, 2022

Split Hierarchical Variational Compression.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022

PILC: Practical Image Lossless Compression with an End-to-end GPU Oriented Neural Framework.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022

2021
iFlow: Numerically Invertible Flows for Efficient Lossless Compression via a Uniform Coder.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

NASOA: Towards Faster Task-oriented Online Fine-tuning with a Zoo of Models.
Proceedings of the 2021 IEEE/CVF International Conference on Computer Vision, 2021

iVPF: Numerical Invertible Volume Preserving Flow for Efficient Lossless Compression.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2021

2020
GMrepo: a database of curated and consistently annotated human gut metagenomes.
Nucleic Acids Res., 2020

Fully Online Matching.
J. ACM, 2020

VEGA: Towards an End-to-End Configurable AutoML Pipeline.
CoRR, 2020

2018
Online Submodular Maximization with Free Disposal.
ACM Trans. Algorithms, 2018

How to match when all vertices arrive online.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Online Makespan Minimization: The Power of Restart.
Proceedings of the Approximation, 2018

2017
Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids.
CoRR, 2016

Online Algorithms for Covering and Packing Problems with Convex Objectives.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Online Convex Covering and Packing Problems.
CoRR, 2015


  Loading...