Daxin Zhu
Orcid: 0000-0002-8060-7368
According to our database1,
Daxin Zhu
authored at least 38 papers
between 2011 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2022
Int. J. Data Warehous. Min., 2022
Super-resolution reconstruction of pneumocystis carinii pneumonia images based on generative confrontation network.
Comput. Methods Programs Biomed., 2022
Fully connected network with multi-scale dilation convolution module in evaluating atrial septal defect based on MRI segmentation.
Comput. Methods Programs Biomed., 2022
2021
Management of medical and health big data based on integrated learning-based health care system: A review and comparative analysis.
Comput. Methods Programs Biomed., 2021
Comparative analysis of pulmonary nodules segmentation using multiscale residual U-Net and fuzzy C-means clustering.
Comput. Methods Programs Biomed., 2021
Automatic segmentation of cardiac magnetic resonance images based on multi-input fusion network.
Comput. Methods Programs Biomed., 2021
2019
Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints.
J. Comput. Biol., 2019
A Robust Visual Tracking Algorithm Based on Spatial-Temporal Context Hierarchical Response Fusion.
Algorithms, 2019
2017
A space efficient algorithm for the longest common subsequence in k-length substrings.
Theor. Comput. Sci., 2017
J. Discrete Algorithms, 2017
Proceedings of the Security, Privacy, and Anonymity in Computation, Communication, and Storage, 2017
Proceedings of the Security, Privacy, and Anonymity in Computation, Communication, and Storage, 2017
2016
A simple linear space algorithm for computing a longest common increasing subsequence.
CoRR, 2016
Proceedings of the Smart Computing and Communication, 2016
Efficient Computation for the Longest Common Subsequence with Substring Inclusion and Subsequence Exclusion Constraints.
Proceedings of the Smart Computing and Communication, 2016
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2016
Proceedings of the Network and Parallel Computing, 2016
Proceedings of the Health Information Science - 5th International Conference, 2016
Proceedings of the Green, Pervasive, and Cloud Computing - 11th International Conference, 2016
Proceedings of the Green, Pervasive, and Cloud Computing - 11th International Conference, 2016
Proceedings of the Intelligent Information and Database Systems - 8th Asian Conference, 2016
2015
A Practical O(R<i>log log</i> n+n) time Algorithm for Computing the Longest Common Subsequence.
CoRR, 2015
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints.
CoRR, 2015
A Dynamic Programming Algorithm for a Generalized LCS Problem with Multiple Subsequence Inclusion Constraints.
Proceedings of the Internet of Vehicles - Safe and Intelligent Mobility, 2015
Proceedings of the Algorithms and Architectures for Parallel Processing, 2015
Proceedings of the Algorithms and Architectures for Parallel Processing, 2015
2014
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints.
J. Discrete Algorithms, 2014
An Efficient Continued Fraction Algorithm for Nonlinear Optimization and Its Computer Implementation.
J. Comput., 2014
2013
Inf. Process. Lett., 2013
An Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains
CoRR, 2013
A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint.
Algorithms, 2013
2011
Proceedings of the Artificial Intelligence and Computational Intelligence, 2011