H. K. Dai

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