Name Card
Dr Ting, Hing Fung 田慶豐
Title:
Honorary Associate Professor
Department:
Faculty:
Publications - Conference Papers
| Title | Author(s) | Issue Date | |
|---|---|---|---|
Computing the unrooted maximum agreement subtree in sub-quadratic time Proceeding/Conference:Proceedings of the 5th Scandinavian Workshop on Algorithm and Theory, Singapore | 1996 | ||
Competitive Analysis of On-line Stream Merging Algorithms Proceeding/Conference:27th International Symposium on Mathematical Foundations of Computer Science | 2002 | ||
Competitive algorithms for unbounded One-Way Trading Proceeding/Conference:Lecture Notes in Computer Science | 2014 | ||
Competitive algorithms for online pricing Proceeding/Conference:Lecture Notes in Computer Science | 2011 | ||
BioNumQA-BERT: Answering Biomedical Questions Using Numerical Facts with a Deep Language Representation Model Proceeding/Conference:The 12th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM BCB 2021) | 2021 | ||
BASE: A practical de novo assembler for large genomes using longer NGS reads Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2015 | ||
Approximation and competitive algorithms for single-minded selling problem Proceeding/Conference:The Twelfth International Conference on Algorithmic Aspects in Information and Management Proceedings | 2018 | ||
An approximation algorithm for bounded length tree linear broadcast routing Proceeding/Conference:International Computer Symposium | 1996 | ||
Approximating frequent items in asynchronous data stream over a sliding window Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2009 | ||
Approximated distributed minimum vertex cover algorithms for bounded degree graphs Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2010 | ||
Analyzing the Error Rates of Bitcoin Clustering Heuristics Proceeding/Conference:The Eighteenth IFIP WG 11.9 International Conference on Digital Forensics, Virtual, 2022 | 2022 | ||
ALMOST LINEAR TIME AND O(N LOG N plus E) MESSAGES DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING TREES. Proceeding/Conference:Annual Symposium on Foundations of Computer Science (Proceedings) | 1985 | ||
Allowing mismatches in anchors for wholw genome alignment: Generation and effectiveness Proceeding/Conference:Series on Advances In Bioinformatics and Computational Biology | 2005 | ||
All-cavity maximum Matchings Proceeding/Conference:International Symposium on Algorithms And Computation | 1997 | ||
AC-DIAMOND: accelerating protein alignment via better SIMD parallelization and space-efficient indexing Proceeding/Conference:Lecture Notes in Computer Science | 2016 | ||
A simple and economical method for improving whole genome alignment Proceeding/Conference:IEEE International Conference on Computational Advances in Bio and Medical Sciences Proceedings | 2015 | ||
A data-centric pipeline using convolutional neural network to select better multiple sequence alignment method Proceeding/Conference:Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics (BCB '20) | 2020 | ||
A 5-competitive on-line scheduler for merging video streams Proceeding/Conference:Proceedings of 15th International Parallel and Distributed Processing Symposium | 2001 | ||
1-space bounded algorithms for 2-dimensional bin packing Proceeding/Conference:2nd Asian Association for Algorithms and Computation Meeting, AAAC 2009 | 2009 | ||
1-bounded space algorithms for 2-dimensional bin packing Proceeding/Conference:Lecture Notes in Computer Science | 2009 |
Are You Missing Publications, Invited Lectures? Click Me.