关注
Xiaozhou He
标题
引用次数
引用次数
年份
Approximate nearest neighbors in the space of persistence diagrams
BT Fasy, X He, Z Liu, S Micka, DL Millman, B Zhu
arXiv preprint arXiv:1812.11257, 2018
132018
On the minimum copy number generation problem in cancer genomics
L Qingge, X He, Z Liu, B Zhu
Proceedings of the 2018 ACM International Conference on Bioinformatics …, 2018
82018
Optimizing large-scale COVID-19 nucleic acid testing with a dynamic testing site deployment strategy
X He, L Luo, X Tang, Q Wang
Healthcare 11 (3), 393, 2023
62023
Risk factors associated with postoperative complications after liver cancer resection surgery in western China
Y Hu, S Zeng, L Li, Y Fang, X He
Cost Effectiveness and Resource Allocation 19, 1-10, 2021
62021
An online algorithm for the inventory retrieval problem with an uncertain selling duration, uncertain prices, and price-dependent demands
X He, J Xiang, J Xiao, TCE Cheng, Y Tian
Computers & Operations Research 148, 105991, 2022
42022
Association of outdoor air pollution with the medical expense of ischemic stroke: the case study of an industrial city in western China
S Zeng, L Luo, F Chen, Y Li, M Chen, X He
The International Journal of Health Planning and Management 36 (3), 715-728, 2021
42021
Cost control of treatment for cerebrovascular patients using a machine learning model in western China
S Zeng, L Luo, Y Fang, X He
Journal of Healthcare Engineering 2021 (1), 6158961, 2021
42021
A location-routing model for free-floating shared bike collection considering manual gathering and truck transportation
X He, Q Wang
Socio-Economic Planning Sciences 88, 101667, 2023
32023
The longest commonly positioned increasing subsequences problem
X He, Y Xu
Journal of Combinatorial Optimization 35, 331-340, 2018
32018
代价敏感的客户流失预测半监督集成模型研究
肖进, 李思涵, 贺小舟, 腾格尔, 贾品荣, 谢玲
系统工程理论与实践 41 (1), 188-199, 2021
22021
Efficient algorithms for computing one or two discrete centers hitting a set of line segments
X He, Z Liu, B Su, Y Xu, F Zheng, B Zhu
Journal of Combinatorial Optimization 37, 1408-1423, 2019
12019
Hitting a Set of Line Segments with One or Two Discrete Centers.
X He, Z Liu, B Su, Y Xu, F Zheng, B Zhu
CCCG, 85-90, 2018
12018
A stochastic programming model for free-floating shared bike redistribution considering bike gathering
X He, Q Wang
Socio-Economic Planning Sciences, 101993, 2024
2024
Patient Readmission for Ischemic Stroke: Risk Factors and Impact on Mortality
C Liu, L Luo, X He, T Wang, X Liu, Y Liu
INQUIRY: The Journal of Health Care Organization, Provision, and Financing …, 2024
2024
Big Data-Enabled Analysis of Factors Affecting Medical Expenditure in the Cerebral Infarction of a Developing City in Western China
S Zeng, Y Zhang, C Guo, X Zhou, X He
Risk Management and Healthcare Policy, 2703-2714, 2023
2023
Promotion Strategy of Reduce Fare-dodging Based on System Dynamics from the Perspective on Evolutionary Game
J Tang, X He, Z Wang, S Zeng
2021 International Conference on Electronic Communications, Internet of …, 2021
2021
Dispersing and grouping points on planar segments
X He, W Lai, B Zhu, P Zou
Theoretical Computer Science 886, 169-177, 2021
2021
Dispersing and Grouping Points on Segments in the Plane
X He, W Lai, B Zhu, P Zou
International Conference on Theory and Applications of Models of Computation …, 2020
2020
Corrigendum to:“Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares”[Theor. Comput. Sci. 769 (2019) 63–74]
S Sadhu, X He, S Roy, SC Nandy, S Roy
Theoretical Computer Science 806, 632-640, 2020
2020
系统目前无法执行此操作,请稍后再试。
文章 1–19