Haitao Jiang

Orcid: 0009-0001-8985-4525

According to our database1, Haitao Jiang authored at least 86 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Positioning Aviation Bolts in Narrow Spaces: A Deep Learning-Based Visual Approach at Arbitrary Shooting Angles.
IEEE Trans. Instrum. Meas., 2024

Flanked Block-Interchange Distance on Strings.
IEEE ACM Trans. Comput. Biol. Bioinform., 2024

2023
Efficient Vanishing Point Estimation for Accurate Camera Rotation Estimation in Indoor Environments.
IEEE Robotics Autom. Lett., November, 2023

Large Language Model for Causal Decision Making.
CoRR, 2023

Men Can't Always be Transformed into Mice: Decision Algorithms and Complexity for Sorting by Symmetric Reversals.
CoRR, 2023

Ground-Challenge: A Multi-sensor SLAM Dataset Focusing on Corner Cases for Ground Robots.
Proceedings of the IEEE International Conference on Robotics and Biomimetics, 2023

A Robust and Efficient EKF-based GNSS-Visual-Inertial Odometry.
Proceedings of the IEEE International Conference on Robotics and Biomimetics, 2023

On Sorting by Flanked Transpositions.
Proceedings of the Bioinformatics Research and Applications - 19th International Symposium, 2023

Improving Math Word Problems Solver with Logical Semantic Similarity.
Proceedings of the International Joint Conference on Neural Networks, 2023

Cabbage Can't Always Be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric Reversals.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Edge-cloud Collaboration Based Service Deployment and Resource Allocation in Digital Twin 6G network.
Proceedings of the 2023 International Conference on Communication Network and Machine Learning, 2023

Longest Order Conserved Repetition-free Subsequences.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2023

Minimize Maximum Coverage of Fragment Alignment Selection.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2023

Improved Approximation Algorithms for Sorting Unsigned Genomes by Reversals.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2023

2022
Approximation algorithms for sorting by bounded singleton moves.
Theor. Comput. Sci., 2022

Algorithms and Hardness for Scaffold Filling to Maximize Increased Duo-Preservations.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Resource Allocation in DT-Assisted Internet of Vehicles via Edge Intelligent Cooperation.
IEEE Internet Things J., 2022

Locally Aggregated Feature Attribution on Natural Language Model Understanding.
Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2022

Research on Firmware Vulnerability Mining Model of Power Internet of Things.
Proceedings of the Big Data and Security - 4th International Conference, 2022

CoAtGIN: Marrying Convolution and Attention for Graph-based Molecule Property Prediction.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2022

Longest k-tuple Common Sub-Strings.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2022

2021
Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs.
Theor. Comput. Sci., 2021

On the solution bound of two-sided scaffold filling.
Theor. Comput. Sci., 2021

Non-parallel hyperplanes ordinal regression machine.
Knowl. Based Syst., 2021

Fasu-Net: Fast Alzheimer's Disease Screening with Undersampled MRI Using Convolutional Neural Networks.
J. Medical Imaging Health Informatics, 2021

Sorting a Permutation by Best Short Swaps.
Algorithmica, 2021

An approximation algorithm for unifying adjacencies by double cut and joins in unsigned genomes.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2021

2020
A 1.375-approximation algorithm for unsigned translocation sorting.
J. Comput. Syst. Sci., 2020

Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear Linear Programming-Rounding.
J. Comput. Biol., 2020

Breakpoint distance and PQ-trees.
Inf. Comput., 2020

Optimization of the Active disturbance rejection control of a Four-Rotor Aircraft.
Mechatron. Syst. Control., 2020

2019
Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding.
Proceedings of the Bioinformatics Research and Applications - 15th International Symposium, 2019

A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

An Approximation Algorithm for Sorting by Bounded Singleton Moves.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018
Optimal and Suboptimal Resource Sharing Schemes for Underlaid D2D Communications.
Wirel. Pers. Commun., 2018

Can a breakpoint graph be decomposed into none other than 2-cycles?
Theor. Comput. Sci., 2018

Solving the maximum internal spanning tree problem on interval graphs in polynomial time.
Theor. Comput. Sci., 2018

A 2-approximation algorithm for the contig-based genomic scaffold filling problem.
J. Bioinform. Comput. Biol., 2018

Can a permutation be sorted by best short swaps?.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

The Longest Common Exemplar Subsequence Problem.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2018

2017
A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

A New Approximation Algorithm for the Maximum Stacking Base Pairs Problem from RNA Secondary Structures Prediction.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
A 1.5-Approximation Algorithm for Two-Sided Scaffold Filling.
Algorithmica, 2016

A New Approximation Algorithm for Unsigned Translocation Sorting.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Notes on the 6/5-Approximation Algorithm for One-Sided Scaffold Filling.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Genomic Scaffold Filling Revisited.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
A factor-(1.408 + ε) approximation for sorting unsigned genomes by reciprocal translocations.
Theor. Comput. Sci., 2015

Isomorphism and similarity for 2-generation pedigrees.
BMC Bioinform., 2015

Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
A linear kernel for the complementary maximal strip recovery problem.
J. Comput. Syst. Sci., 2014

Radiation hybrid map construction problem parameterized.
J. Comb. Optim., 2014

An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

On the Exact Block Cover Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013
An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

KBT: Operating System Kernel Level Binary Translation System.
J. Softw., 2013

2012
A (1+ε)-approximation algorithm for sorting by short block-moves.
Theor. Comput. Sci., 2012

Scaffold Filling under the Breakpoint and Related Distances.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Minimum common string partition revisited.
J. Comb. Optim., 2012

Exact and approximation algorithms for the complementary maximal strip recovery problem.
J. Comb. Optim., 2012

Comparing Pedigree Graphs.
J. Comput. Biol., 2012

UKCF: A New Graphics Driver Cross-Platform Translation Framework for Virtual Machines.
Proceedings of the Network and Parallel Computing, 9th IFIP International Conference, 2012

Improve Indirect Branch Prediction with Private Cache in Dynamic Binary Translation.
Proceedings of the 14th IEEE International Conference on High Performance Computing and Communication & 9th IEEE International Conference on Embedded Software and Systems, 2012

2011
A 14/11-approximation algorithm for sorting by short block-moves.
Sci. China Inf. Sci., 2011

Algorithms for sorting unsigned linear genomes by the DCJ operations.
Bioinform., 2011

Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem.
Proceedings of the Combinatorial Optimization and Applications, 2011

2010
Weak Kernels.
Electron. Colloquium Comput. Complex., 2010

Algorithms for Comparing Pedigree Graphs
CoRR, 2010

Scaffold Filling under the Breakpoint Distance.
Proceedings of the Comparative Genomics - International Workshop, 2010

A heuristic algorithm for minimum-recombinant haplotyping in pedigrees: Implementation and parallelization.
Proceedings of the 3rd International Conference on Information Sciences and Interaction Sciences (ICIS 2010), 2010

A New Parallel Method of Smith-Waterman Algorithm on a Heterogeneous Platform.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2010

Breakpoint Distance and PQ-Trees.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

A Linear Kernel for Co-Path/Cycle Packing.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
A (1+e)-Approximation Algorithm for Sorting by Short Block-Moves.
Proceedings of the Second International Joint Conference on Computational Sciences and Optimization, 2009

2002
Smart VideoText: a video data model based on conceptual graphs.
Multim. Syst., 2002

1999
Integrated Video and Text for Content-based Access to Video Databases.
Multim. Tools Appl., 1999

1998
Spatial and Temporal Content-Based Access to Hypervideo Databases.
VLDB J., 1998

WVTDB - A Semantic Content-Based Video Database System on the World Wide Web.
IEEE Trans. Knowl. Data Eng., 1998

Scene Change Detection Techniques for Video Database Systems.
Multim. Syst., 1998

1997
Video Database Systems - Issues, Products and Applications
Advances in Database Systems 5, Kluwer, ISBN: 978-0-7923-9872-1, 1997

VideoText Database Systems.
Proceedings of the International Conference on Multimedia Computing and Systems, 1997


  Loading...