H. K. Dai

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 19

Top Topics

Wireless Sensor Networks

Top Venues

SN Comput. Sci.

Int. J. Bus. Intell. Data Min.

Publications

H. K. Dai, H. C. Su
Clustering Analyses of Two-Dimensional Space-Filling Curves: Hilbert and z-Order Curves. SN Comput. Sci. 4 (1) (2023)
H. K. Dai, K. Furusawa
Maintenance Algorithms for 0-Complete Trees with Improved Space Utilization. FDSE (2023)
Michel Toulouse, H. K. Dai, Q. L. Nguyen
A Consensus-Based Load-Balancing Algorithm for Sharded Blockchains. CoRR (2022)
Michel Toulouse, H. K. Dai, Truong Giang Le
Distributed load-balancing for account-based sharded blockchains. Int. J. Web Inf. Syst. 18 (2/3) (2022)
H. K. Dai, K. Furusawa
Improving the Storage Utilization of 0-Complete Trees as Index Structures. FDSE (CCIS Volume) (2022)
H. K. Dai, H. C. Su
Clustering Analyses of Two-Dimensional Space-Filling Curves. FDSE (2021)
H. K. Dai, H. C. Su
Studies of Norm-Based Locality Measures of Two-Dimensional Hilbert Curves. SN Comput. Sci. 2 (5) (2021)
H. K. Dai, H. C. Su
On Norm-Based Locality Measures of 2-Dimensional Discrete Hilbert Curves. FDSE (2020)
H. K. Dai, Michel Toulouse
Relating Network-Diameter and Network-Minimum-Degree for Distributed Function Computation. FDSE (2020)
H. K. Dai, Michel Toulouse
Lower-Bound Study for Function Computation in Distributed Networks via Vertex-Eccentricity. SN Comput. Sci. 1 (1) (2020)
H. K. Dai, Michel Toulouse
Lower Bound on Network Diameter for Distributed Function Computation. FDSE (2019)
H. K. Dai, Zhu Wang
Two parallel algorithms for finding all minimal maximum subsequences. J. Comput. Syst. Sci. 104 (2019)
H. K. Dai, H. C. Su
The complexity of cluster-connectivity of wireless sensor networks. Int. J. Bus. Intell. Data Min. 15 (3) (2019)
H. K. Dai
Finding All Minimal Maximum Subsequences in Parallel. FDSE (2019)
H. K. Dai
Episode-Rule Mining with Minimal Occurrences via First Local Maximization in Confidence. SoICT (2018)
H. K. Dai, Michel Toulouse
Lower Bound for Function Computation in Distributed Networks. FDSE (2018)
H. K. Dai
On Transformation-Based Spatial Access Methods with Monotone Norms. FDSE (2017)
H. K. Dai, H. C. Su
On the Cluster-Connectivity of Wireless Sensor Networks. ICCSA (2) (2016)
H. K. Dai, H. C. Su
Norm-Based Locality Measures of Two-Dimensional Hilbert Curves. AAIM (2016)
H. K. Dai, H. C. Su
Distance Metric on Multidimensional Spatial Objects. ICCSA (Short Papers/poster papers/PhD student showcase works) (2015)
H. K. Dai
Length lower bounds for reflecting sequences and universal traversal sequences. Discret. Math. 338 (6) (2015)
H. K. Dai, Zhu Wang
A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk. LATA (2015)
H. K. Dai, H. C. Su
Clustering Performance of 3-Dimensional Hilbert Curves. AAIM (2014)
H. K. Dai, Zhu Wang
Data mining of serial-episode association rules using gap-constrained minimal occurrences. Int. J. Bus. Intell. Data Min. 8 (3) (2013)
H. K. Dai, Zhu Wang
Mining Serial-Episode Rules Using Minimal Occurrences with Gap Constraint. ICCSA (1) (2013)
H. K. Dai, Kyu-Young Whang, Hung-Chi Su
Locality of Corner Transformation for Multidimensional Spatial Access Methods. Electron. Notes Theor. Comput. Sci. 212 (2008)
Jin Hwan Park, H. K. Dai
Reconfigurable hardware solution to parallel prefix computation. J. Supercomput. 43 (1) (2008)
H. K. Dai, Y. Du
On the Bounded-Delay Minimum-Cost Path Problem of Quality-of-Service Routing. ICCCN (2007)
H. K. Dai, C.-T. Yeh, Zhu Wang
On Digital Watermarking via Public-Key Cryptosystems. PDPTA (2007)
H. K. Dai, C.-T. Yeh
Content-Based Image Watermarking Via Public-Key Cryptosystems. ICCSA (1) (2007)
H. K. Dai, G. Wang
Mining a Class of Complex Episodes in Event Sequences. AAIM (2005)
C. C. Chiang, H. K. Dai
On the Minimum-Cost Set-Covering Problem. PDPTA (2005)
H. K. Dai, Hung-Chi Su
On p-Norm Based Locality Measures of Space-Filling Curves. ISAAC (2004)
H. K. Dai, Xi-Wen Zhang
Improved Linear Expected-Time Algorithms for Computing Maxima. LATIN (2004)
K. H. Choi, H. K. Dai
A Marking Scheme Using Huffman Codes for IP Traceback. ISPAN (2004)
H. K. Dai, Z. Li, Hung-Chi Su
An Empirical Study of Bounded Delay Constrained Bandwidth Routing. PDPTA (2004)
Jing Peng, Douglas R. Heisterkamp, H. K. Dai
Adaptive Quasiconformal Kernel Nearest Neighbor Classification. IEEE Trans. Pattern Anal. Mach. Intell. 26 (5) (2004)
H. K. Dai, A. Raju, Venkatesh Sarangan
Routing in Mobile Ad Hoc Networks Based on Block Decomposition. PDPTA (2004)
H. K. Dai, Hung-Chi Su
On the Locality Properties of Space-Filling Curves. ISAAC (2003)
Andy Auyeung, Iker Gondra, H. K. Dai
Multi-Heuristic List Scheduling Genetic Algorithms for Task Scheduling. SAC (2003)
H. K. Dai, Hung-Chi Su
An Empirical Study of p-Norm Based Locality Measures of Space-Filling Curves. PDPTA (2003)
Jing Peng, Douglas R. Heisterkamp, H. K. Dai
LDA/SVM driven nearest neighbor classification. IEEE Trans. Neural Networks 14 (4) (2003)
H. K. Dai, K. C. Su
Locality Performance of Some Mesh-indexings. PDPTA (2002)
Jing Peng, Douglas R. Heisterkamp, H. K. Dai
Adaptive Kernel Metric Nearest Neighbor Classification. ICPR (3) (2002)
Jing Peng, Douglas R. Heisterkamp, H. K. Dai
LDA/SVM Driven Nearest Neighbor Classification. CVPR (1) (2001)
H. K. Dai
Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences. COCOON (2001)
Douglas R. Heisterkamp, Jing Peng, H. K. Dai
Adaptive Quasiconformal Kernel Metric for Image Retrieval. CVPR (2) (2001)
H. K. Dai, Shinji Fujino
On Designing Constrained Local Access Network. ISPAN (2000)
H. K. Dai, Shinji Fujino
Improving the Esau-Williams Algorithm for Designing Local Access Networks. PDPTA (2000)
Douglas R. Heisterkamp, Jing Peng, H. K. Dai
Feature Relevance Learning with Query Shifting for Content-Based Image Retrieval. ICPR (2000)
H. K. Dai
On Structural Modification Learning Algorithms. PDPTA (1999)
H. K. Dai
Deciding Strictly Non-Blocking Generalized-Concentration Properties with Constrained Network Parameters. ISPAN (1999)
H. K. Dai
The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties. Int. J. Found. Comput. Sci. 8 (3) (1997)
H. K. Dai
The Size Complexity of Strictly Non-blocking Fixed Ratio Concentrators with Constant Depth. Euro-Par, Vol. I (1996)
H. K. Dai, Kevin E. Flannery
Improved Length Lower Bounds for Reflecting Sequences. COCOON (1996)
John Folland, H. K. Dai
Warpnet: Neural Network with a Parabolic Warp. Parallel and Distributed Computing and Systems (1995)
H. K. Dai
An Improvement in the Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentration Networks. PARLE (1994)
H. K. Dai
On Synchronous Strictly Non-Blocking Concentrators and Generalized-Concentrators. IPPS (1993)
H. K. Dai
Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentrators. ICCI (1993)
H. K. Dai
The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties with Small Depth. ICCI (1993)