Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentrators. - H. K. Dai 001 (ICCI, 1993)

The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties with Small Depth. - H. K. Dai 001 (ICCI, 1993)

On Synchronous Strictly Non-Blocking Concentrators and Generalized-Concentrators. - H. K. Dai 001 (IPPS, 1993)

An Improvement in the Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentration Networks. - H. K. Dai 001 (PARLE, 1994)

Warpnet: Neural Network with a Parabolic Warp. - John Folland; H. K. Dai 001 (Parallel and Distributed Computing and Systems, 1995)

Improved Length Lower Bounds for Reflecting Sequences. - H. K. Dai 001; Kevin E. Flannery (COCOON, 1996)

The Size Complexity of Strictly Non-blocking Fixed Ratio Concentrators with Constant Depth. - H. K. Dai 001 (Euro-Par, Vol. I, 1996)

The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties. - H. K. Dai 001 (Int. J. Found. Comput. Sci., 1997)

Deciding Strictly Non-Blocking Generalized-Concentration Properties with Constrained Network Parameters. - H. K. Dai 001 (ISPAN, 1999)

On Structural Modification Learning Algorithms. - H. K. Dai 001 (PDPTA, 1999)

Feature Relevance Learning with Query Shifting for Content-Based Image Retrieval. - Douglas R. Heisterkamp; Jing Peng; H. K. Dai 001 (ICPR, 2000)

On Designing Constrained Local Access Network. - H. K. Dai 001; Shinji Fujino (ISPAN, 2000)

Improving the Esau-Williams Algorithm for Designing Local Access Networks. - H. K. Dai 001; Shinji Fujino (PDPTA, 2000)

Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences. - H. K. Dai 001 (COCOON, 2001)

Adaptive Quasiconformal Kernel Metric for Image Retrieval. - Douglas R. Heisterkamp; Jing Peng; H. K. Dai 001 (CVPR (2), 2001)

Adaptive Kernel Metric Nearest Neighbor Classification. - Jing Peng; Douglas R. Heisterkamp; H. K. Dai 001 (ICPR (3), 2002)

Locality Performance of Some Mesh-indexings. - H. K. Dai 001; K. C. Su (PDPTA, 2002)

Approximation and Analytical Studies of Inter-clustering Performances of Space-Filling Curves. - Ho-Kwok Dai; Hung-Chi Su (DRW, 2003)

On the Locality Properties of Space-Filling Curves. - H. K. Dai 001; Hung-Chi Su (ISAAC, 2003)

An Empirical Study of p-Norm Based Locality Measures of Space-Filling Curves. - H. K. Dai 001; Hung-Chi Su (PDPTA, 2003)

Multi-Heuristic List Scheduling Genetic Algorithms for Task Scheduling. - Andy Auyeung; Iker Gondra; H. K. Dai 001 (SAC, 2003)

LDA/SVM driven nearest neighbor classification. - Jing Peng; Douglas R. Heisterkamp; H. K. Dai 001 (IEEE Trans. Neural Networks, 2003)

On p-Norm Based Locality Measures of Space-Filling Curves. - H. K. Dai 001; Hung-Chi Su (ISAAC, 2004)

A Marking Scheme Using Huffman Codes for IP Traceback. - K. H. Choi; H. K. Dai 001 (ISPAN, 2004)

Improved Linear Expected-Time Algorithms for Computing Maxima. - H. K. Dai 001; Xi-Wen Zhang (LATIN, 2004)

An Empirical Study of Bounded Delay Constrained Bandwidth Routing. - H. K. Dai 001; Z. Li; Hung-Chi Su (PDPTA, 2004)

Routing in Mobile Ad Hoc Networks Based on Block Decomposition. - H. K. Dai 001; A. Raju; Venkatesh Sarangan (PDPTA, 2004)

Adaptive Quasiconformal Kernel Nearest Neighbor Classification. - Jing Peng; Douglas R. Heisterkamp; H. K. Dai 001 (IEEE Trans. Pattern Anal. Mach. Intell., 2004)

Mining a Class of Complex Episodes in Event Sequences. - H. K. Dai 001; G. Wang (AAIM, 2005)

On the Minimum-Cost Set-Covering Problem. - C. C. Chiang; H. K. Dai 001 (PDPTA, 2005)

A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences. - Ho-Kwok Dai; Hung-Chi Su (LATIN, 2006)

On the Bounded-Delay Minimum-Cost Path Problem of Quality-of-Service Routing. - H. K. Dai 001; Y. Du (ICCCN, 2007)

Content-Based Image Watermarking Via Public-Key Cryptosystems. - H. K. Dai 001; C.-T. Yeh (ICCSA (1), 2007)

On Digital Watermarking via Public-Key Cryptosystems. - H. K. Dai 001; C.-T. Yeh; Zhu Wang 011 (PDPTA, 2007)

A survey of DNA motif finding algorithms. - Modan K. Das; Ho-Kwok Dai (BMC Bioinform., 2007)

Locality of Corner Transformation for Multidimensional Spatial Access Methods. - H. K. Dai 001; Kyu-Young Whang; Hung-Chi Su (FICS, 2008)

Reconfigurable hardware solution to parallel prefix computation. - Jin Hwan Park; H. K. Dai 001 (J. Supercomput., 2008)

Mining Serial-Episode Rules Using Minimal Occurrences with Gap Constraint. - H. K. Dai 001; Zhu Wang 011 (ICCSA (1), 2013)

Data mining of serial-episode association rules using gap-constrained minimal occurrences. - H. K. Dai 001; Zhu Wang 011 (Int. J. Bus. Intell. Data Min., 2013)

Clustering Performance of 3-Dimensional Hilbert Curves. - H. K. Dai 001; H. C. Su (AAIM, 2014)

Distance Metric on Multidimensional Spatial Objects. - H. K. Dai 001; H. C. Su (ICCSA (Short Papers/poster papers/PhD student showcase works), 2015)

A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk. - H. K. Dai 001; Zhu Wang 011 (LATA, 2015)

Length lower bounds for reflecting sequences and universal traversal sequences. - H. K. Dai 001 (Discret. Math., 2015)

Norm-Based Locality Measures of Two-Dimensional Hilbert Curves. - H. K. Dai 001; H. C. Su (AAIM, 2016)

On the Cluster-Connectivity of Wireless Sensor Networks. - H. K. Dai 001; H. C. Su (ICCSA (2), 2016)

On Transformation-Based Spatial Access Methods with Monotone Norms. - H. K. Dai 001 (FDSE, 2017)

Lower Bound for Function Computation in Distributed Networks. - H. K. Dai 001; Michel Toulouse (FDSE, 2018)

Episode-Rule Mining with Minimal Occurrences via First Local Maximization in Confidence. - H. K. Dai 001 (SoICT, 2018)

Finding All Minimal Maximum Subsequences in Parallel. - H. K. Dai 001 (FDSE, 2019)

Lower Bound on Network Diameter for Distributed Function Computation. - H. K. Dai 001; Michel Toulouse (FDSE, 2019)

The complexity of cluster-connectivity of wireless sensor networks. - H. K. Dai 001; H. C. Su (Int. J. Bus. Intell. Data Min., 2019)

Two parallel algorithms for finding all minimal maximum subsequences. - H. K. Dai 001; Zhu Wang 011 (J. Comput. Syst. Sci., 2019)

On Norm-Based Locality Measures of 2-Dimensional Discrete Hilbert Curves. - H. K. Dai 001; H. C. Su (FDSE, 2020)

Relating Network-Diameter and Network-Minimum-Degree for Distributed Function Computation. - H. K. Dai 001; Michel Toulouse (FDSE, 2020)

Lower-Bound Study for Function Computation in Distributed Networks via Vertex-Eccentricity. - H. K. Dai 001; Michel Toulouse (SN Comput. Sci., 2020)

Extremal Problem with Network-Diameter and -Minimum-Degree for Distributed Function Computation. - Ho-Kwok Dai; Michel Toulouse (SN Comput. Sci., 2020)

Clustering Analyses of Two-Dimensional Space-Filling Curves. - H. K. Dai 001; H. C. Su (FDSE, 2021)

A Consensus-Based Load-Balancing Algorithm for Sharded Blockchains. - Michel Toulouse; Ho-Kwok Dai; Q. L. Nguyen (FDSE, 2021)

Studies of Norm-Based Locality Measures of Two-Dimensional Hilbert Curves. - H. K. Dai 001; H. C. Su (SN Comput. Sci., 2021)

Improving the Storage Utilization of 0-Complete Trees as Index Structures. - H. K. Dai 001; K. Furusawa (FDSE (CCIS Volume), 2022)

Distributed load-balancing for account-based sharded blockchains. - Michel Toulouse; H. K. Dai 001; Truong Giang Le (Int. J. Web Inf. Syst., 2022)

Maintenance Algorithms for 0-Complete Trees with Improved Space Utilization. - H. K. Dai 001; K. Furusawa (FDSE, 2023)

Clustering Analyses of Two-Dimensional Space-Filling Curves: Hilbert and z-Order Curves. - H. K. Dai 001; H. C. Su (SN Comput. Sci., 2023)

On the Two-Dimensional Parity-Check Method. - H. K. Dai 001 (FDSE (2), 2024)

Improving the Storage Utilization of 0-Complete Trees. - H. K. Dai 001; K. Furusawa (SN Comput. Sci., 2024)