default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHu Ding
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. The links to all actual bibliographies of persons of the same or a similar name can be found below. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Other persons with the same name
- Hu Ding 0001
![[0000-0003-4301-1108]](https://dblp.org/img/orcid-mark.12x12.png "0000-0003-4301-1108")
— Shanghai University, Shanghai, China - Hu Ding 0002 — South China Normal University, Guangzhou, China
- Hu Ding 0003 — University of Science and Technology of China, Hefei, China
- Hu Ding 0004 — Tianjin University, Tianjin, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j5]Hu Ding, Yan Yan, Yang Lu, Jing-Hao Xue, Hanzi Wang:
Uncertainty-Aware Label Refinement on Hypergraphs for Personalized Federated Facial Expression Recognition. IEEE Trans. Circuits Syst. Video Technol. 35(5): 4675-4685 (2025)- [c29]Qi Chen, Hu Ding:
Dual Energy-Based Model with Open-World Uncertainty Estimation for Out-of-distribution Detection. CVPR 2025: 25728-25737 - [c28]Guowei Sun, Lin Chen, Qiming Huang, Hu Ding:
To Tackle Cost-Skew Tradeoff: An Adaptive Learning Approach for Hub Node Selection. DAC 2025: 1-7 - [c27]Shihong Song, Guanlin Mo, Hu Ding:
Relax and Merge: A Simple Yet Effective Framework for Solving Fair k-Means and k-sparse Wasserstein Barycenter Problems. ICLR 2025 - [c26]Xianglu Wang, Hu Ding:
Exploring The Forgetting in Adversarial Training: A Novel Method for Enhancing Robustness. ICLR 2025 - [c25]Wanlin Zhang, Weichen Lin, Ruomin Huang, Shihong Song, Hu Ding:
To Tackle Adversarial Transferability: A Novel Ensemble Training Method with Fourier Transformation. ICLR 2025 - [c24]Yuntao Wang, Yuxuan Li, Qingyuan Yang, Hu Ding:
Finding Wasserstein Ball Center: Efficient Algorithm and The Applications in Fairness. ICML 2025 - [i23]Hu Ding, Yan Yan, Yang Lu, Jing-Hao Xue, Hanzi Wang:
Uncertainty-Aware Label Refinement on Hypergraphs for Personalized Federated Facial Expression Recognition. CoRR abs/2501.01816 (2025) - 2024
- [j4]Ze-Qi Lu, Rong-Biao Hao, Hu Ding, Li-Qun Chen:
A study of a nonlinear vibration isolator supported on an imperfect boundary plate. Commun. Nonlinear Sci. Numer. Simul. 128: 107671 (2024) - [c23]Xiaoyang Xu, Hu Ding:
A Novel Skip Orthogonal List for Dynamic Optimal Transport Problem. AAAI 2024: 20838-20846 - [c22]Weichen Lin, Jiaxiang Chen, Ruomin Huang, Hu Ding:
An Effective Dynamic Gradient Calibration Method for Continual Learning. ICML 2024 - [c21]Qingyuan Yang, Hu Ding:
Approximate Algorithms for k-Sparse Wasserstein Barycenter with Outliers. IJCAI 2024: 5316-5325 - [i22]Qingyuan Yang, Hu Ding:
Approximate Algorithms For k-Sparse Wasserstein Barycenter With Outliers. CoRR abs/2404.13401 (2024) - [i21]Guanlin Mo, Shihong Song, Hu Ding:
Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms. CoRR abs/2405.06899 (2024) - [i20]Weichen Lin, Jiaxiang Chen, Ruomin Huang, Hu Ding:
An Effective Dynamic Gradient Calibration Method for Continual Learning. CoRR abs/2407.20956 (2024) - [i19]Shihong Song, Guanlin Mo, Qingyuan Yang, Hu Ding:
Relax and Merge: A Simple Yet Effective Framework for Solving Fair k-Means and k-sparse Wasserstein Barycenter Problems. CoRR abs/2411.01115 (2024) - 2023
- [j3]Bin Zhang, Xiaofang Zhang, Wenan Jiang, Hu Ding, Liqun Chen, Qinsheng Bi:
Bursting oscillations induced by multiple coexisting attractors in a modified 3D van der Pol-Duffing system. Commun. Nonlinear Sci. Numer. Simul. 116: 106806 (2023) - [j2]Haitao Li, Bojian Dong, Fan Cao, Weiyang Qin, Hu Ding, Liqun Chen:
Nonlinear dynamical and harvesting characteristics of bistable energy harvester under hybrid base vibration and galloping. Commun. Nonlinear Sci. Numer. Simul. 125: 107400 (2023) - [c20]Liying Yang, Guowei Sun, Hu Ding:
Towards Timing-Driven Routing: An Efficient Learning Based Geometric Approach. ICCAD 2023: 1-9 - [c19]Wufan Zhao, Claudio Persello, Hu Ding, Alfred Stein:
Learning General Representations for Semantic Segmentation and Height Estimation from Remote Sensing Images. JURSE 2023: 1-4 - [i18]Hu Ding, Ruomin Huang, Kai Liu, Haikuo Yu, Zixiu Wang:
Randomized Greedy Algorithms and Composable Coreset for k-Center Clustering with Outliers. CoRR abs/2301.02814 (2023) - [i17]Hu Ding:
Sublinear Time Algorithms for Several Geometric Optimization (With Outliers) Problems In Machine Learning. CoRR abs/2301.02870 (2023) - [i16]Xiaoyang Xu, Hu Ding:
A Novel Skip Orthogonal List for Dynamic Optimal Transport Problem. CoRR abs/2310.18446 (2023) - 2022
- [c18]Shuangshuang Xue, Hu Ding, Lan Zhang, Haisheng Tan, Xiang-Yang Li:
Online Competitive Posted-Pricing Mechanism for Trading Time-Sensitive Valued Data. BigCom 2022: 44-53 - [c17]Jiaxiang Chen, Qingyuan Yang, Ruomin Huang, Hu Ding:
Coresets for Relational Data and The Applications. NeurIPS 2022 - [c16]Qi Chen, Kai Liu, Ruilong Yao, Hu Ding:
Sublinear time algorithms for greedy selection in high dimensions. UAI 2022: 346-356 - [i15]Jiaxiang Chen, Qingyuan Yang, Ruomin Huang, Hu Ding:
Coresets for Relational Data and The Applications. CoRR abs/2210.04249 (2022) - 2021
- [c15]Hu Ding:
Stability Yields Sublinear Time Algorithms for Geometric Optimization in Machine Learning. ESA 2021: 38:1-38:19 - [c14]Ruizhe Qin, Mengying Li, Hu Ding:
Solving Soft Clustering Ensemble via $k$-Sparse Discrete Wasserstein Barycenter. NeurIPS 2021: 900-913 - [c13]Zixiu Wang, Yiwen Guo, Hu Ding:
Robust and Fully-Dynamic Coreset for Continuous-and-Bounded Learning (With Outliers) Problems. NeurIPS 2021: 14319-14331 - [c12]Hu Ding, Tan Chen, Fan Yang, Mingyue Wang:
A Data-Dependent Algorithm for Querying Earth Mover's Distance with Low Doubling Dimensions. SDM 2021: 630-638 - [i14]Zixiu Wang, Yiwen Guo, Hu Ding:
Robust Coreset for Continuous-and-Bounded Learning (with Outliers). CoRR abs/2107.00068 (2021) - 2020
- [j1]Hu Ding:
Faster balanced clusterings in high dimension. Theor. Comput. Sci. 842: 28-40 (2020) - [c11]Hu Ding, Zixiu Wang:
Layered Sampling for Robust Optimization Problems. ICML 2020: 2556-2566 - [c10]Hu Ding, Fan Yang, Mingyue Wang:
On Metric DBSCAN with Low Doubling Dimension. IJCAI 2020: 3080-3086 - [c9]Xiaoxiao Zhang, Liangjun Wang, Xuesen Chu, Hu Ding, Wu Zhang:
Parallel Computing and Optimization of Lattice Boltzmann Method Based on SW26010 Processor. ISPA/BDCloud/SocialCom/SustainCom 2020: 34-40 - [i13]Hu Ding, Zixiu Wang:
Layered Sampling for Robust Optimization Problems. CoRR abs/2002.11904 (2020) - [i12]Hu Ding, Fan Yang:
On Metric DBSCAN with Low Doubling Dimension. CoRR abs/2002.11933 (2020) - [i11]Hu Ding, Tan Chen, Mingyue Wang, Fan Yang:
A Data Dependent Algorithm for Querying Earth Mover's Distance with Low Doubling Dimension. CoRR abs/2002.12354 (2020) - [i10]Hu Ding:
A Sub-linear Time Framework for Geometric Optimization with Outliers in High Dimensions. CoRR abs/2004.10090 (2020) - [i9]Guannan Hu, Wu Zhang, Hu Ding, Wenhao Zhu:
Gradient Episodic Memory with a Soft Constraint for Continual Learning. CoRR abs/2011.07801 (2020)
2010 – 2019
- 2019
- [c8]Hu Ding, Mingquan Ye:
On Geometric Alignment in Low Doubling Dimension. AAAI 2019: 1460-1467 - [c7]Hu Ding, Haikuo Yu, Zixiu Wang:
Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction. ESA 2019: 40:1-40:16 - [c6]Haoyang Fan, Shaohua Li, Hu Ding, Junning Zhang:
Simulation Analysis of Vehicle Trajectory Tracking Based on Model Predictive Control. ISIE 2019: 1892-1897 - [i8]Hu Ding:
Minimum Enclosing Ball Revisited: Stability and Sub-linear Time Algorithms. CoRR abs/1904.03796 (2019) - [i7]Hu Ding, Haikuo Yu:
A Practical Framework for Solving Center-Based Clustering with Outliers. CoRR abs/1905.10143 (2019) - 2018
- [c5]Hu Ding, Manni Liu:
On Geometric Prototype and Applications. ESA 2018: 23:1-23:15 - [i6]Hu Ding, Mingquan Ye:
Solving Minimum Enclosing Ball with Outliers: Algorithm, Implementation, and Application. CoRR abs/1804.09653 (2018) - [i5]Hu Ding, Manni Liu:
On Geometric Prototype And Applications. CoRR abs/1804.09655 (2018) - [i4]Hu Ding:
Faster Balanced Clusterings in High Dimension. CoRR abs/1809.00932 (2018) - [i3]Hu Ding, Mingquan Ye:
On Geometric Alignment in Low Doubling Dimension. CoRR abs/1811.07455 (2018) - 2017
- [c4]Hu Ding:
Balanced k-Center Clustering When k Is A Constant. CCCG 2017: 179-184 - [c3]Manni Liu, Hu Ding:
Protein Mover's Distance: A Geometric Framework for Solving Global Alignment of PPI Networks. COCOA (1) 2017: 56-69 - [c2]Hu Ding, Lunjia Hu, Lingxiao Huang, Jian Li:
Capacitated Center Problems with Two-Sided Bounds and Outliers. WADS 2017: 325-336 - [i2]Hu Ding, Lunjia Hu, Lingxiao Huang, Jian Li:
Capacitated Center Problems with Two-Sided Bounds and Outliers. CoRR abs/1702.07435 (2017) - [i1]Hu Ding:
Balanced k-Center Clustering When k Is A Constant. CoRR abs/1704.02515 (2017) - 2016
- [c1]Hu Ding, Yu Liu, Lingxiao Huang, Jian Li:
K-Means Clustering with Distributed Dimensions. ICML 2016: 1339-1348
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-12-08 10:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
