Han Cai

Orcid: 0000-0002-8476-1303

According to our database1, Han Cai authored at least 91 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An Efficient Coding Scheme for the AWGN Relay Network With Receiver-Transmitter Feedback.
IEEE Syst. J., September, 2024

Locally repairable codes with multiple repair sets based on packings of block size 4.
Cryptogr. Commun., May, 2024

Minimum Storage Partially Cooperative Regenerating Codes With Small Sub-Packetization.
IEEE Trans. Commun., January, 2024

Model Acceleration for Efficient Deep Learning Computing
PhD thesis, 2024

On singleton-type bound of locally repairable codes.
Discret. Math., 2024

COAT: Compressing Optimizer states and Activation for Memory-Efficient FP8 Training.
CoRR, 2024

HART: Efficient Visual Generation with Hybrid Autoregressive Transformer.
CoRR, 2024

Deep Compression Autoencoder for Efficient High-Resolution Diffusion Models.
CoRR, 2024

SANA: Efficient High-Resolution Image Synthesis with Linear Diffusion Transformers.
CoRR, 2024

MDS Generalized Convertible Code.
CoRR, 2024

Condition-Aware Neural Network for Controlled Image Generation.
CoRR, 2024

DistriFusion: Distributed Parallel Inference for High-Resolution Diffusion Models.
CoRR, 2024

A Transformation of Repairing Reed-Solomon Codes from Rack-Aware Storage Model to Homogeneous Storage Model.
CoRR, 2024

Robust Multi-Sensor Multi-Target Tracking Using Possibility Labeled Multi-Bernoulli Filter.
CoRR, 2024

Construction of Locally Repairable Array Codes with Optimal Repair Bandwidth Under the Rack-Aware Storage Model.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Repairing Schemes for Tamo-Barg Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Decentralised multi-sensor target tracking with limited field of view via possibility theory.
Proceedings of the 27th International Conference on Information Fusion, 2024

EfficientViT-SAM: Accelerated Segment Anything Model Without Performance Loss.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2024

DistriFusion: Distributed Parallel Inference for High-Resolution Diffusion Models.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2024

Condition-Aware Neural Network for Controlled Image Generation.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2024

2023
A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization.
IEEE Trans. Inf. Theory, May, 2023

A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It.
IEEE Trans. Inf. Theory, April, 2023

Possibility Generalized Labeled Multi-Bernoulli Filter for Multitarget Tracking Under Epistemic Uncertainty.
IEEE Trans. Aerosp. Electron. Syst., April, 2023

EfficientViT: Lightweight Multi-Scale Attention for High-Resolution Dense Prediction.
Proceedings of the IEEE/CVF International Conference on Computer Vision, 2023

A Cooperative Repair Scheme for MSR Codes with Two Erasures and Small Finite Field.
Proceedings of the 23rd IEEE International Conference on Communication Technology, 2023

2022
Enable Deep Learning on Mobile Devices: Methods, Systems, and Applications.
ACM Trans. Design Autom. Electr. Syst., 2022

A Construction of Maximally Recoverable Codes With Order-Optimal Field Size.
IEEE Trans. Inf. Theory, 2022

Optimal Locally Repairable Codes: An Improved Bound and Constructions.
IEEE Trans. Inf. Theory, 2022

EfficientViT: Enhanced Linear Attention for High-Resolution Low-Computation Visual Recognition.
CoRR, 2022

A class of minimum storage cooperative regenerating codes with low access property.
Adv. Math. Commun., 2022

Network Augmentation for Tiny Deep Learning.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Lite Pose: Efficient Architecture Design for 2D Human Pose Estimation.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022

2021
On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes.
IEEE Trans. Inf. Theory, 2021

MCUNetV2: Memory-Efficient Patch-based Inference for Tiny Deep Learning.
CoRR, 2021

Memory-efficient Patch-based Inference for Tiny Deep Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

An Improved Bound for Optimal Locally Repairable Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021


2020
On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets.
IEEE Trans. Inf. Theory, 2020

On Optimal Locally Repairable Codes With Super-Linear Length.
IEEE Trans. Inf. Theory, 2020

Network-Coding Solutions for Minimal Combination Networks and Their Sub-Networks.
IEEE Trans. Inf. Theory, 2020

AutoML for Architecting Efficient and Specialized Neural Networks.
IEEE Micro, 2020

Tiny Transfer Learning: Towards Memory-Efficient On-Device Learning.
CoRR, 2020

APQ: Joint Search for Network Architecture, Pruning and Quantization Policy.
CoRR, 2020

TinyTL: Reduce Memory, Not Parameters for Efficient On-Device Learning.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Once-for-All: Train One Network and Specialize it for Efficient Deployment.
Proceedings of the 8th International Conference on Learning Representations, 2020

APQ: Joint Search for Network Architecture, Pruning and Quantization Policy.
Proceedings of the 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020

HAT: Hardware-Aware Transformers for Efficient Natural Language Processing.
Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, 2020

2019
Optimal Locally Repairable Systematic Codes Based on Packings.
IEEE Trans. Commun., 2019

Once for All: Train One Network and Specialize it for Efficient Deployment.
CoRR, 2019

Design Automation for Efficient Deep Learning Computing.
CoRR, 2019

Layout Design for Intelligent Warehouse by Evolution With Fitness Approximation.
IEEE Access, 2019

Network Coding Solutions for the Combination Network and its Subgraphs.
Proceedings of the IEEE International Symposium on Information Theory, 2019

ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardware.
Proceedings of the 7th International Conference on Learning Representations, 2019

On-Device Image Classification with Proxyless Neural Architecture Search and Quantization-Aware Fine-Tuning.
Proceedings of the 2019 IEEE/CVF International Conference on Computer Vision Workshops, 2019

Schmidt-Kalman Filter with Polynomial Chaos Expansion for State Estimation.
Proceedings of the 22th International Conference on Information Fusion, 2019

Large-Scale Interactive Recommendation with Tree-Structured Policy Gradient.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Improvement of Reflection Detection Success Rate of GNSS RO Measurements Using Artificial Neural Network.
IEEE Trans. Geosci. Remote. Sens., 2018

Path-Level Network Transformation for Efficient Architecture Search.
Proceedings of the 35th International Conference on Machine Learning, 2018

Activation Maximization Generative Adversarial Nets.
Proceedings of the 6th International Conference on Learning Representations, 2018

MAgent: A Many-Agent Reinforcement Learning Platform for Artificial Collective Intelligence.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Long Text Generation via Adversarial Training with Leaked Information.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Efficient Architecture Search by Network Transformation.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Zero-Difference Balanced Functions With New Parameters and Their Applications.
IEEE Trans. Inf. Theory, 2017

MAgent: A Many-Agent Reinforcement Learning Platform for Artificial Collective Intelligence.
CoRR, 2017

Generative Adversarial Nets with Labeled Data by Activation Maximization.
CoRR, 2017

Reinforcement Learning for Architecture Search by Network Transformation.
CoRR, 2017

Real-Time Bidding by Reinforcement Learning in Display Advertising.
Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 2017

Volume Ranking and Sequential Selection in Programmatic Display Advertising.
Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017

2016
Exploiting Double Opportunities for Latency-Constrained Content Propagation in Wireless Networks.
IEEE/ACM Trans. Netw., 2016

A Combinatorial Construction for Strictly Optimal Frequency-Hopping Sequences.
IEEE Trans. Inf. Theory, 2016

Strictly Optimal Frequency-Hopping Sequence Sets With Optimal Family Sizes.
IEEE Trans. Inf. Theory, 2016

Product-Based Neural Networks for User Response Prediction.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

2015
Constructions of Optimal 2-D Optical Orthogonal Codes via Generalized Cyclotomic Classes.
IEEE Trans. Inf. Theory, 2015

2014
A New Construction of Frequency-Hopping Sequences With Optimal Partial Hamming Correlation.
IEEE Trans. Inf. Theory, 2014

Families of <i>p</i>-ary sequences with low correlation and large linear complexity.
J. Syst. Sci. Complex., 2014

2013
Optimal Frequency Hopping Sequences of Odd Length.
IEEE Trans. Inf. Theory, 2013

A New Construction of Zero-Difference Balanced Functions and Its Applications.
IEEE Trans. Inf. Theory, 2013

New Optimal frequency Hopping sequence Sets from Balanced Nested difference Packings of Partition-Type.
Int. J. Found. Comput. Sci., 2013

Exploiting double opportunities for deadline based content propagation in wireless networks.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

2012
A Class of Optimal Frequency Hopping Sequences with New Parameters.
IEEE Trans. Inf. Theory, 2012

2009
Multicast scheduling in cellular data networks.
IEEE Trans. Wirel. Commun., 2009

Crossing over the bounded domain: from exponential to power-law intermeeting time in mobile ad hoc networks.
IEEE/ACM Trans. Netw., 2009

Stochastic convex ordering for multiplicative decrease internet congestion control.
Comput. Networks, 2009

Stochastic link-level dynamics in mobile ad-hoc networks: several interesting aspects.
Proceedings of the 2009 MobiHoc S³ workshop on MobiHoc S³, 2009

Aging rules: what does the past tell about the future in mobile ad-hoc networks?
Proceedings of the 10th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2009

2008
Toward stochastic anatomy of inter-meeting time distribution under general mobility models.
Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2008

Invariance Property of Isotropic Random Walk Mobility Patterns in Mobile Ad-Hoc Networks.
Proceedings of IEEE International Conference on Communications, 2008

Tuning Up the Performance of Constant-Time Distributed Scheduling Algorithms via Majorization.
Proceedings of IEEE International Conference on Communications, 2008

2007
Crossing over the bounded domain: from exponential to power-law inter-meeting time in manet.
Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, 2007

Stochastic Ordering for Internet Congestion Control and its Applications.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006
Stability of Network Congestion Control with Asynchronous Updates.
Proceedings of the 45th IEEE Conference on Decision and Control, 2006


  Loading...