H. K. Dai

According to our database, H. K. Dai authored at least 63 papers between 1993 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Clustering Analyses of Two-Dimensional Space-Filling Curves: Hilbert and z-Order Curves.

H. K. Dai, H. C. Su

SN Comput. Sci., 2023

Maintenance Algorithms for 0-Complete Trees with Improved Space Utilization.

H. K. Dai, K. Furusawa

Proceedings of the Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications, 2023

2022

Distributed load-balancing for account-based sharded blockchains.

Michel Toulouse, H. K. Dai, Truong Giang Le

Int. J. Web Inf. Syst., 2022

Improving the Storage Utilization of 0-Complete Trees as Index Structures.

H. K. Dai, K. Furusawa

Proceedings of the Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications, 2022

2021

Studies of Norm-Based Locality Measures of Two-Dimensional Hilbert Curves.

H. K. Dai, H. C. Su

SN Comput. Sci., 2021

A Consensus-Based Load-Balancing Algorithm for Sharded Blockchains.

Michel Toulouse, Ho-Kwok Dai, Q. L. Nguyen

Proceedings of the Future Data and Security Engineering - 8th International Conference, 2021

Clustering Analyses of Two-Dimensional Space-Filling Curves.

H. K. Dai, H. C. Su

Proceedings of the Future Data and Security Engineering - 8th International Conference, 2021

2020

Extremal Problem with Network-Diameter and -Minimum-Degree for Distributed Function Computation.

Ho-Kwok Dai, Michel Toulouse

SN Comput. Sci., 2020

Lower-Bound Study for Function Computation in Distributed Networks via Vertex-Eccentricity.

H. K. Dai, Michel Toulouse

SN Comput. Sci., 2020

Relating Network-Diameter and Network-Minimum-Degree for Distributed Function Computation.

H. K. Dai, Michel Toulouse

Proceedings of the Future Data and Security Engineering - 7th International Conference, 2020

On Norm-Based Locality Measures of 2-Dimensional Discrete Hilbert Curves.

H. K. Dai, H. C. Su

Proceedings of the Future Data and Security Engineering - 7th International Conference, 2020

2019

Two parallel algorithms for finding all minimal maximum subsequences.

H. K. Dai, Zhu Wang

J. Comput. Syst. Sci., 2019

The complexity of cluster-connectivity of wireless sensor networks.

H. K. Dai, H. C. Su

Int. J. Bus. Intell. Data Min., 2019

Lower Bound on Network Diameter for Distributed Function Computation.

H. K. Dai, Michel Toulouse

Proceedings of the Future Data and Security Engineering - 6th International Conference, 2019

Finding All Minimal Maximum Subsequences in Parallel.

H. K. Dai

Proceedings of the Future Data and Security Engineering - 6th International Conference, 2019

2018

Episode-Rule Mining with Minimal Occurrences via First Local Maximization in Confidence.

H. K. Dai

Proceedings of the Ninth International Symposium on Information and Communication Technology, 2018

Lower Bound for Function Computation in Distributed Networks.

H. K. Dai, Michel Toulouse

Proceedings of the Future Data and Security Engineering - 5th International Conference, 2018

2017

On Transformation-Based Spatial Access Methods with Monotone Norms.

H. K. Dai

Proceedings of the Future Data and Security Engineering - 4th International Conference, 2017

2016

On the Cluster-Connectivity of Wireless Sensor Networks.

H. K. Dai, H. C. Su

Proceedings of the Computational Science and Its Applications - ICCSA 2016, 2016

Norm-Based Locality Measures of Two-Dimensional Hilbert Curves.

H. K. Dai, H. C. Su

Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015

Length lower bounds for reflecting sequences and universal traversal sequences.

H. K. Dai

Discret. Math., 2015

A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk.

H. K. Dai, Zhu Wang

Proceedings of the Language and Automata Theory and Applications, 2015

Distance Metric on Multidimensional Spatial Objects.

H. K. Dai, H. C. Su

Proceedings of the 15th International Conference on Computational Science and Its Applications, 2015

2014

Clustering Performance of 3-Dimensional Hilbert Curves.

H. K. Dai, H. C. Su

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Data mining of serial-episode association rules using gap-constrained minimal occurrences.

H. K. Dai, Zhu Wang

Int. J. Bus. Intell. Data Min., 2013

Mining Serial-Episode Rules Using Minimal Occurrences with Gap Constraint.

H. K. Dai, Zhu Wang

Proceedings of the Computational Science and Its Applications - ICCSA 2013, 2013

2008

Reconfigurable hardware solution to parallel prefix computation.

Jin Hwan Park, H. K. Dai

J. Supercomput., 2008

Locality of Corner Transformation for Multidimensional Spatial Access Methods.

H. K. Dai, Kyu-Young Whang, Hung-Chi Su

Proceedings of the First International Conference on Foundations of Informatics, 2008

2007

A survey of DNA motif finding algorithms.

Modan K. Das, Ho-Kwok Dai

BMC Bioinform., 2007

On Digital Watermarking via Public-Key Cryptosystems.

H. K. Dai, C.-T. Yeh, Zhu Wang

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2007

Content-Based Image Watermarking Via Public-Key Cryptosystems.

H. K. Dai, C.-T. Yeh

Proceedings of the Computational Science and Its Applications, 2007

On the Bounded-Delay Minimum-Cost Path Problem of Quality-of-Service Routing.

H. K. Dai, Y. Du

Proceedings of the 16th International Conference on Computer Communications and Networks, 2007

2006

A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences.

Ho-Kwok Dai, Hung-Chi Su

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

On the Minimum-Cost Set-Covering Problem.

C. C. Chiang, H. K. Dai

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005

Mining a Class of Complex Episodes in Event Sequences.

H. K. Dai, G. Wang

Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004

Adaptive Quasiconformal Kernel Nearest Neighbor Classification.

Jing Peng, Douglas R. Heisterkamp, H. K. Dai

IEEE Trans. Pattern Anal. Mach. Intell., 2004

Routing in Mobile Ad Hoc Networks Based on Block Decomposition.

H. K. Dai, A. Raju, Venkatesh Sarangan

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

An Empirical Study of Bounded Delay Constrained Bandwidth Routing.

H. K. Dai, Z. Li, Hung-Chi Su

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

Improved Linear Expected-Time Algorithms for Computing Maxima.

H. K. Dai, Xi-Wen Zhang

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

A Marking Scheme Using Huffman Codes for IP Traceback.

K. H. Choi, H. K. Dai

Proceedings of the 7th International Symposium on Parallel Architectures, 2004

On p-Norm Based Locality Measures of Space-Filling Curves.

H. K. Dai, Hung-Chi Su

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

LDA/SVM driven nearest neighbor classification.

Jing Peng, Douglas R. Heisterkamp, H. K. Dai

IEEE Trans. Neural Networks, 2003

Multi-Heuristic List Scheduling Genetic Algorithms for Task Scheduling.

Andy Auyeung, Iker Gondra, H. K. Dai

Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

An Empirical Study of p-Norm Based Locality Measures of Space-Filling Curves.

H. K. Dai, Hung-Chi Su

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003

On the Locality Properties of Space-Filling Curves.

H. K. Dai, Hung-Chi Su

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Approximation and Analytical Studies of Inter-clustering Performances of Space-Filling Curves.

Ho-Kwok Dai, Hung-Chi Su

Proceedings of the Discrete Random Walks, 2003

2002

Locality Performance of Some Mesh-indexings.

H. K. Dai, K. C. Su

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2002

Adaptive Kernel Metric Nearest Neighbor Classification.

Jing Peng, Douglas R. Heisterkamp, H. K. Dai

Proceedings of the 16th International Conference on Pattern Recognition, 2002

2001

Adaptive Quasiconformal Kernel Metric for Image Retrieval.

Douglas R. Heisterkamp, Jing Peng, H. K. Dai

Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2001), 2001

Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences.

H. K. Dai

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Improving the Esau-Williams Algorithm for Designing Local Access Networks.

H. K. Dai, Shinji Fujino

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

On Designing Constrained Local Access Network.

H. K. Dai, Shinji Fujino

Proceedings of the 5th International Symposium on Parallel Architectures, 2000

Feature Relevance Learning with Query Shifting for Content-Based Image Retrieval.

Douglas R. Heisterkamp, Jing Peng, H. K. Dai

Proceedings of the 15th International Conference on Pattern Recognition, 2000

1999

On Structural Modification Learning Algorithms.

H. K. Dai

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

Deciding Strictly Non-Blocking Generalized-Concentration Properties with Constrained Network Parameters.

H. K. Dai

Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

1997

The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties.

H. K. Dai

Int. J. Found. Comput. Sci., 1997

1996

The Size Complexity of Strictly Non-blocking Fixed Ratio Concentrators with Constant Depth.

H. K. Dai

Proceedings of the Euro-Par '96 Parallel Processing, 1996

Improved Length Lower Bounds for Reflecting Sequences.

H. K. Dai, Kevin E. Flannery

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

Warpnet: Neural Network with a Parabolic Warp.

John Folland, H. K. Dai

Proceedings of the Seventh IASTED/ISMM International Conference on Parallel and Distributed Computing and Systems, 1995

1994

An Improvement in the Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentration Networks.

H. K. Dai

Proceedings of the PARLE '94: Parallel Architectures and Languages Europe, 1994

1993

On Synchronous Strictly Non-Blocking Concentrators and Generalized-Concentrators.

H. K. Dai

Proceedings of the Seventh International Parallel Processing Symposium, 1993

The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties with Small Depth.

H. K. Dai

Proceedings of the Computing and Information, 1993

Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentrators.

H. K. Dai

Proceedings of the Computing and Information, 1993