default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHu Ding 0003
Person information
- affiliation: University of Science and Technology of China, Hefei, China
- affiliation (2016 - 2018): Michigan State University, MI, USA
- affiliation (2015 - 2016): Tsinghua University, Beijing, China
- affiliation (PhD 2015): State University of New York at Buffalo, NY, USA
Other persons with the same name
- Hu Ding
- Hu Ding 0001
![[0000-0003-4301-1108]](https://devdomain4test.ir/img/orcid-mark.12x12.png "0000-0003-4301-1108")
— Shanghai University, Shanghai, China - Hu Ding 0002 — South China Normal University, Guangzhou, China
- Hu Ding 0004 — Tianjin University, Tianjin, China
- Hu Ding 0005 — Xiamen University, School of Informatics, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2020 – today
- 2026
[c58]Kangke Cheng, Shihong Song, Guanlin Mo, Hu Ding:
Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High Dimensions. AAAI 2026: 20509-20517- [i33]Kangke Cheng, Shihong Song, Guanlin Mo, Hu Ding:
Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions. CoRR abs/2603.10721 (2026) - 2025
- [j12]Jiawei Huang, Wenjie Liu, Hu Ding:
Bi-criteria sublinear time algorithms for clustering with outliers in high dimensions. Theor. Comput. Sci. 1057: 115538 (2025) - [c57]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 - [c56]Lin Chen, Yuxuan Li, Hu Ding:
Achieving Simultaneous Buffering and Steiner Tree Synthesis via Harmonic Based Reinforcement Learning. ICCAD 2025: 1-9 - [c55]Xianglu Wang, Hu Ding:
Towards Multi-Objective Routing: A Novel Coreset-based Transfer Learning Framework. ICCAD 2025: 1-9 - [c54]Jiawei Huang, Hu Ding:
An Effective Manifold-based Optimization Method for Distributionally Robust Classification. ICLR 2025 - [c53]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 - [c52]Xianglu Wang, Hu Ding:
Exploring The Forgetting in Adversarial Training: A Novel Method for Enhancing Robustness. ICLR 2025 - [c51]Wanlin Zhang, Weichen Lin, Ruomin Huang, Shihong Song, Hu Ding:
To Tackle Adversarial Transferability: A Novel Ensemble Training Method with Fourier Transformation. ICLR 2025 - [c50]Yuntao Wang, Yuxuan Li, Qingyuan Yang, Hu Ding:
Finding Wasserstein Ball Center: Efficient Algorithm and The Applications in Fairness. ICML 2025 - [c49]Jiawei Huang, Minming Li, Hu Ding:
Adaptive and Multi-scale Affinity Alignment for Hierarchical Contrastive Learning. NeurIPS 2025 - [c48]Jiawei Huang, Minming Li, Hu Ding:
Bootstrap Your Uncertainty: Adaptive Robust Classification Driven by Optimal-Transport. NeurIPS 2025 - [i32]Hu Ding, Pengxiang Hua, Zhen Huang:
Survey on Recent Progress of AI for Chemistry: Methods, Applications, and Opportunities. CoRR abs/2502.17456 (2025) - 2024
- [j11]Guanlin Mo, Shihong Song, Hu Ding:
Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms. Proc. ACM Manag. Data 2(3): 178 (2024) - [c47]Xiaoyang Xu, Hu Ding:
A Novel Skip Orthogonal List for Dynamic Optimal Transport Problem. AAAI 2024: 20838-20846 - [c46]Jiawei Huang, Wenjie Liu, Hu Ding:
Bi-criteria Sublinear Time Algorithms for Clustering with Outliers in High Dimensions. COCOON (1) 2024: 91-103 - [c45]Lin Chen, Qi Xu, Hu Ding:
OTPlace-Vias: A Novel Optimal Transport Based Method for High Density Vias Placement in 3D Circuits. DAC 2024: 130:1-130:6 - [c44]Weichen Lin, Jiaxiang Chen, Ruomin Huang, Hu Ding:
An Effective Dynamic Gradient Calibration Method for Continual Learning. ICML 2024: 29872-29889 - [c43]Qingyuan Yang, Hu Ding:
Approximate Algorithms for k-Sparse Wasserstein Barycenter with Outliers. IJCAI 2024: 5316-5325 - [c42]Qi Chen, Wenjie Liu, Hu Ding:
A Novel Confidence Guided Training Method for Conditional GANs with Auxiliary Classifier. ACM Multimedia 2024: 6706-6714 - [i31]Qingyuan Yang, Hu Ding:
Approximate Algorithms For k-Sparse Wasserstein Barycenter With Outliers. CoRR abs/2404.13401 (2024) - [i30]Guanlin Mo, Shihong Song, Hu Ding:
Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms. CoRR abs/2405.06899 (2024) - [i29]Weichen Lin, Jiaxiang Chen, Ruomin Huang, Hu Ding:
An Effective Dynamic Gradient Calibration Method for Continual Learning. CoRR abs/2407.20956 (2024) - [i28]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
- [j10]Hu Ding, Wenjie Liu, Mingquan Ye:
A Data-dependent Approach for High-dimensional (Robust) Wasserstein Alignment. ACM J. Exp. Algorithmics 28: 1.8:1-1.8:32 (2023) - [c41]Liying Yang, Guowei Sun, Hu Ding:
Towards Timing-Driven Routing: An Efficient Learning Based Geometric Approach. ICCAD 2023: 1-9 - [c40]Wenjie Liu, Hu Ding:
Solving Low-Dose CT Reconstruction via GAN with Local Coherence. MICCAI (10) 2023: 524-534 - [i27]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) - [i26]Hu Ding:
Sublinear Time Algorithms for Several Geometric Optimization (With Outliers) Problems In Machine Learning. CoRR abs/2301.02870 (2023) - [i25]Xiaoyang Xu, Hu Ding:
A Novel Skip Orthogonal List for Dynamic Optimal Transport Problem. CoRR abs/2310.18446 (2023) - 2022
- [j9]Jiawei Huang, Ruizhe Qin, Fan Yang, Hu Ding:
Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers. Int. J. Comput. Geom. Appl. 32(3&4): 201-225 (2022) - [c39]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 - [c38]Jiaxiang Chen, Qingyuan Yang, Ruomin Huang, Hu Ding:
Coresets for Relational Data and The Applications. NeurIPS 2022 - [c37]Ruomin Huang, Jiawei Huang, Wenjie Liu, Hu Ding:
Coresets for Wasserstein Distributionally Robust Optimization Problems. NeurIPS 2022 - [c36]Qi Chen, Kai Liu, Ruilong Yao, Hu Ding:
Sublinear time algorithms for greedy selection in high dimensions. UAI 2022: 346-356 - [i24]Hu Ding, Wenjie Liu, Mingquan Ye:
A Data-dependent Approach for High Dimensional (Robust) Wasserstein Alignment. CoRR abs/2209.02905 (2022) - [i23]Jiaxiang Chen, Qingyuan Yang, Ruomin Huang, Hu Ding:
Coresets for Relational Data and The Applications. CoRR abs/2210.04249 (2022) - [i22]Ruomin Huang, Jiawei Huang, Wenjie Liu, Hu Ding:
Coresets for Wasserstein Distributionally Robust Optimization Problems. CoRR abs/2210.04260 (2022) - 2021
- [c35]Hu Ding:
Stability Yields Sublinear Time Algorithms for Geometric Optimization in Machine Learning. ESA 2021: 38:1-38:19 - [c34]Jiawei Huang, Ruomin Huang, Wenjie Liu, Nikolaos M. Freris, Hu Ding:
A Novel Sequential Coreset Method for Gradient Descent Algorithms. ICML 2021: 4412-4422 - [c33]Ruizhe Qin, Mengying Li, Hu Ding:
Solving Soft Clustering Ensemble via $k$-Sparse Discrete Wasserstein Barycenter. NeurIPS 2021: 900-913 - [c32]Zixiu Wang, Yiwen Guo, Hu Ding:
Robust and Fully-Dynamic Coreset for Continuous-and-Bounded Learning (With Outliers) Problems. NeurIPS 2021: 14319-14331 - [c31]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 - [c30]Hu Ding, Fan Yang, Jiawei Huang:
Defending SVMs against poisoning attacks: the hardness and DBSCAN approach. UAI 2021: 268-278 - [i21]Hu Ding, Jiawei Huang:
Is Simple Uniform Sampling Efficient for Center-Based Clustering With Outliers: When and Why? CoRR abs/2103.00558 (2021) - [i20]Zixiu Wang, Yiwen Guo, Hu Ding:
Robust Coreset for Continuous-and-Bounded Learning (with Outliers). CoRR abs/2107.00068 (2021) - [i19]Jiawei Huang, Ruomin Huang, Wenjie Liu, Nikolaos M. Freris, Hu Ding:
A Novel Sequential Coreset Method for Gradient Descent Algorithms. CoRR abs/2112.02504 (2021) - 2020
- [j8]Hu Ding, Jinhui Xu:
A Unified Framework for Clustering Constrained Data Without Locality Property. Algorithmica 82(4): 808-852 (2020) - [j7]Yangwei Liu, Hu Ding, Ziyun Huang, Jinhui Xu:
Distributed and Robust Support Vector Machine. Int. J. Comput. Geom. Appl. 30(3&4): 213-233 (2020) - [j6]Hu Ding, Jinhui Xu:
Learning the truth vector in high dimensions. J. Comput. Syst. Sci. 109: 78-94 (2020) - [j5]Hu Ding:
Faster balanced clusterings in high dimension. Theor. Comput. Sci. 842: 28-40 (2020) - [c29]Hu Ding:
A Sub-Linear Time Framework for Geometric Optimization with Outliers in High Dimensions. ESA 2020: 38:1-38:21 - [c28]Hu Ding, Zixiu Wang:
Layered Sampling for Robust Optimization Problems. ICML 2020: 2556-2566 - [c27]Hu Ding, Fan Yang, Mingyue Wang:
On Metric DBSCAN with Low Doubling Dimension. IJCAI 2020: 3080-3086 - [i18]Hu Ding, Zixiu Wang:
Layered Sampling for Robust Optimization Problems. CoRR abs/2002.11904 (2020) - [i17]Hu Ding, Ruizhe Qin, Jiawei Huang:
The Effectiveness of Johnson-Lindenstrauss Transform for High Dimensional Optimization with Outliers. CoRR abs/2002.11923 (2020) - [i16]Hu Ding, Fan Yang:
On Metric DBSCAN with Low Doubling Dimension. CoRR abs/2002.11933 (2020) - [i15]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) - [i14]Hu Ding:
A Sub-linear Time Framework for Geometric Optimization with Outliers in High Dimensions. CoRR abs/2004.10090 (2020) - [i13]Hu Ding, Fan Yang, Jiawei Huang:
Defending Support Vector Machines against Poisoning Attacks: the Hardness and Algorithm. CoRR abs/2006.07757 (2020)
2010 – 2019
- 2019
- [j4]Ziyun Huang, Hu Ding, Jinhui Xu:
A Faster Algorithm for Truth Discovery via Range Cover. Algorithmica 81(10): 4118-4133 (2019) - [c26]Hu Ding, Mingquan Ye:
On Geometric Alignment in Low Doubling Dimension. AAAI 2019: 1460-1467 - [c25]Hu Ding, Haikuo Yu, Zixiu Wang:
Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction. ESA 2019: 40:1-40:16 - [c24]Haoyang Fan, Shaohua Li, Hu Ding, Junning Zhang:
Simulation Analysis of Vehicle Trajectory Tracking Based on Model Predictive Control. ISIE 2019: 1892-1897 - [i12]Hu Ding:
Greedy Strategy Works for Clustering with Outliers and Coresets Construction. CoRR abs/1901.08219 (2019) - [i11]Hu Ding:
Minimum Enclosing Ball Revisited: Stability and Sub-linear Time Algorithms. CoRR abs/1904.03796 (2019) - [i10]Hu Ding, Haikuo Yu:
A Practical Framework for Solving Center-Based Clustering with Outliers. CoRR abs/1905.10143 (2019) - 2018
- [c23]Hu Ding, Manni Liu:
On Geometric Prototype and Applications. ESA 2018: 23:1-23:15 - [i9]Hu Ding, Mingquan Ye:
Solving Minimum Enclosing Ball with Outliers: Algorithm, Implementation, and Application. CoRR abs/1804.09653 (2018) - [i8]Hu Ding, Manni Liu:
On Geometric Prototype And Applications. CoRR abs/1804.09655 (2018) - [i7]Hu Ding:
Faster Balanced Clusterings in High Dimension. CoRR abs/1809.00932 (2018) - [i6]Hu Ding, Jinhui Xu:
A Unified Framework for Clustering Constrained Data without Locality Property. CoRR abs/1810.01049 (2018) - [i5]Hu Ding, Mingquan Ye:
On Geometric Alignment in Low Doubling Dimension. CoRR abs/1811.07455 (2018) - 2017
- [j3]Hu Ding, Jinhui Xu:
FPTAS for Minimizing the Earth Mover's Distance Under Rigid Transformations and Related Problems. Algorithmica 78(3): 741-770 (2017) - [c22]Yangwei Liu, Hu Ding, Danyang Chen, Jinhui Xu:
Novel Geometric Approach for Global Alignment of PPI Networks. AAAI 2017: 31-37 - [c21]Hu Ding:
Balanced k-Center Clustering When k Is A Constant. CCCG 2017: 179-184 - [c20]Manni Liu, Hu Ding:
Protein Mover's Distance: A Geometric Framework for Solving Global Alignment of PPI Networks. COCOA (1) 2017: 56-69 - [c19]Hu Ding, Lunjia Hu, Lingxiao Huang, Jian Li:
Capacitated Center Problems with Two-Sided Bounds and Outliers. WADS 2017: 325-336 - [c18]Ziyun Huang, Hu Ding, Jinhui Xu:
Faster Algorithm for Truth Discovery via Range Cover. WADS 2017: 461-472 - [i4]Hu Ding, Lunjia Hu, Lingxiao Huang, Jian Li:
Capacitated Center Problems with Two-Sided Bounds and Outliers. CoRR abs/1702.07435 (2017) - [i3]Hu Ding:
Balanced k-Center Clustering When k Is A Constant. CoRR abs/1704.02515 (2017) - 2016
- [j2]Hu Ding, Branislav Stojkovic, Zihe Chen, Andrew Hughes, Lei Xu, Andrew J. Fritz, Nitasha Sehgal, Ronald Berezney, Jinhui Xu:
Chromatic kernel and its applications. J. Comb. Optim. 31(3): 1298-1315 (2016) - [c17]Hu Ding, Jing Gao, Jinhui Xu:
Finding Global Optimum for Truth Discovery: Entropy Based Geometric Variance. SoCG 2016: 34:1-34:16 - [c16]Hu Ding, Yu Liu, Lingxiao Huang, Jian Li:
K-Means Clustering with Distributed Dimensions. ICML 2016: 1339-1348 - [c15]Zihe Chen, Danyang Chen, Hu Ding, Ziyun Huang, Zheshuo Li, Nitasha Sehgal, Andrew J. Fritz, Ronald Berezney, Jinhui Xu:
Finding rigid sub-structure patterns from 3D point-sets. ICPR 2016: 1725-1730 - [c14]Yangwei Liu, Hu Ding, Ziyun Huang, Jinhui Xu:
Distributed and Robust Support Vector Machine. ISAAC 2016: 54:1-54:13 - [c13]Hu Ding, Lu Su, Jinhui Xu:
Towards distributed ensemble clustering for networked sensing systems: a novel geometric approach. MobiHoc 2016: 1-10 - 2015
- [c12]Hu Ding, Jinhui Xu:
Random Gradient Descent Tree: A Combinatorial Approach for SVM with Outliers. AAAI 2015: 2561-2567 - [c11]Zihe Chen, Hu Ding, Danyang Chen, Xiangyu Wang, Andrew J. Fritz, Nitasha Sehgal, Ronald Berezney, Jinhui Xu:
Mining k-median chromosome association graphs from a population of heterogeneous cells. BCB 2015: 47-56 - [c10]Chuishi Meng, Wenjun Jiang, Yaliang Li, Jing Gao, Lu Su, Hu Ding, Yun Cheng:
Truth Discovery on Crowd Sensing of Correlated Entities. SenSys 2015: 169-182 - [c9]Hu Ding, Jinhui Xu:
A Unified Framework for Clustering Constrained Data without Locality Property. SODA 2015: 1471-1490 - 2014
- [j1]Andrew J. Fritz, Branislav Stojkovic, Hu Ding, Jinhui Xu, Sambit Bhattacharya, Ronald Berezney:
Cell Type Specific Alterations in Interchromosomal Networks across the Cell Cycle. PLoS Comput. Biol. 10(10) (2014) - [c8]Hu Ding, Jinhui Xu:
Finding Median Point-Set Using Earth Mover's Distance. AAAI 2014: 1781-1787 - [c7]Hu Ding, Jinhui Xu:
Sub-linear Time Hybrid Approximations for Least Trimmed Squares Estimator and Related Problems. SoCG 2014: 110 - 2013
- [c6]Hu Ding, Branislav Stojkovic, Ronald Berezney, Jinhui Xu:
Gauging Association Patterns of Chromosome Territories via Chromatic Median. CVPR 2013: 1296-1303 - [c5]Hu Ding, Jinhui Xu:
FPTAS for Minimizing Earth Mover's Distance under Rigid Transformations. ESA 2013: 397-408 - [c4]Hu Ding, Ronald Berezney, Jinhui Xu:
k-Prototype Learning for 3D Rigid Structures. NIPS 2013: 2589-2597 - 2012
- [c3]Lei Xu, Branislav Stojkovic, Hu Ding, Qi Song, Xiaodong Wu, Milan Sonka, Jinhui Xu:
Efficient searching of globally optimal and smooth multisurfaces with shape priors. Image Processing 2012: 83140N - [i2]Hu Ding, Jinhui Xu:
Chromatic $k$-Mean Clustering in High Dimensional Space. CoRR abs/1204.6699 (2012) - [i1]Hu Ding, Jinhui Xu:
Robust Projective Clustering Under $L_{2}$ Norm. CoRR abs/1204.6717 (2012) - 2011
- [c2]Hu Ding, Jinhui Xu:
Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere. ICALP (1) 2011: 773-784 - [c1]Lei Xu, Branislav Stojkovic, Hu Ding, Qi Song, Xiaodong Wu, Milan Sonka, Jinhui Xu:
Faster Segmentation Algorithm for Optical Coherence Tomography Images with Guaranteed Smoothness. MLMI 2011: 308-316
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 2026-07-12 23:44 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
