default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDH. K. Dai 0001
Person information
- affiliation: Oklahoma State University, Stillwater, OK, USA
- affiliation (former): University of North Dakota, Grand Forks, ND, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]H. K. Dai
, K. Furusawa:
Improving the Storage Utilization of 0-Complete Trees. SN Comput. Sci. 5(7): 946 (2024)- 2023
- [j14]H. K. Dai, H. C. Su:
Clustering Analyses of Two-Dimensional Space-Filling Curves: Hilbert and z-Order Curves. SN Comput. Sci. 4(1): 8 (2023) - [c50]H. K. Dai, K. Furusawa:
Maintenance Algorithms for 0-Complete Trees with Improved Space Utilization. FDSE 2023: 49-63 - 2022
- [j13]Michel Toulouse, H. K. Dai, Truong Giang Le:
Distributed load-balancing for account-based sharded blockchains. Int. J. Web Inf. Syst. 18(2/3): 100-116 (2022) - [c49]H. K. Dai, K. Furusawa:
Improving the Storage Utilization of 0-Complete Trees as Index Structures. FDSE (CCIS Volume) 2022: 88-102 - [i1]Michel Toulouse, H. K. Dai, Q. L. Nguyen:
A Consensus-Based Load-Balancing Algorithm for Sharded Blockchains. CoRR abs/2206.14737 (2022) - 2021
- [j12]H. K. Dai, H. C. Su:
Studies of Norm-Based Locality Measures of Two-Dimensional Hilbert Curves. SN Comput. Sci. 2(5): 403 (2021) - [c48]Michel Toulouse, Ho-Kwok Dai, Q. L. Nguyen:
A Consensus-Based Load-Balancing Algorithm for Sharded Blockchains. FDSE 2021: 239-259 - [c47]H. K. Dai, H. C. Su:
Clustering Analyses of Two-Dimensional Space-Filling Curves. FDSE 2021: 375-391 - 2020
- [j11]H. K. Dai, Michel Toulouse:
Lower-Bound Study for Function Computation in Distributed Networks via Vertex-Eccentricity. SN Comput. Sci. 1(1): 10:1-10:14 (2020) - [j10]Ho-Kwok Dai, Michel Toulouse:
Extremal Problem with Network-Diameter and -Minimum-Degree for Distributed Function Computation. SN Comput. Sci. 1(4): 236 (2020) - [c46]H. K. Dai, Michel Toulouse:
Relating Network-Diameter and Network-Minimum-Degree for Distributed Function Computation. FDSE 2020: 134-150 - [c45]H. K. Dai, H. C. Su:
On Norm-Based Locality Measures of 2-Dimensional Discrete Hilbert Curves. FDSE 2020: 169-184
2010 – 2019
- 2019
- [j9]H. K. Dai, H. C. Su:
The complexity of cluster-connectivity of wireless sensor networks. Int. J. Bus. Intell. Data Min. 15(3): 327-348 (2019) - [j8]H. K. Dai, Zhu Wang:
Two parallel algorithms for finding all minimal maximum subsequences. J. Comput. Syst. Sci. 104: 216-243 (2019) - [c44]H. K. Dai:
Finding All Minimal Maximum Subsequences in Parallel. FDSE 2019: 165-184 - [c43]H. K. Dai, Michel Toulouse:
Lower Bound on Network Diameter for Distributed Function Computation. FDSE 2019: 239-251 - 2018
- [c42]H. K. Dai, Michel Toulouse:
Lower Bound for Function Computation in Distributed Networks. FDSE 2018: 371-384 - [c41]H. K. Dai:
Episode-Rule Mining with Minimal Occurrences via First Local Maximization in Confidence. SoICT 2018: 130-136 - 2017
- [c40]H. K. Dai:
On Transformation-Based Spatial Access Methods with Monotone Norms. FDSE 2017: 85-100 - 2016
- [c39]H. K. Dai, H. C. Su:
Norm-Based Locality Measures of Two-Dimensional Hilbert Curves. AAIM 2016: 14-25 - [c38]H. K. Dai, H. C. Su:
On the Cluster-Connectivity of Wireless Sensor Networks. ICCSA (2) 2016: 19-33 - 2015
- [j7]H. K. Dai:
Length lower bounds for reflecting sequences and universal traversal sequences. Discret. Math. 338(6): 1042-1065 (2015) - [c37]H. K. Dai, H. C. Su:
Distance Metric on Multidimensional Spatial Objects. ICCSA (Short Papers/poster papers/PhD student showcase works) 2015: 52-56 - [c36]H. K. Dai, Zhu Wang:
A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk. LATA 2015: 133-144 - 2014
- [c35]H. K. Dai, H. C. Su:
Clustering Performance of 3-Dimensional Hilbert Curves. AAIM 2014: 299-311 - 2013
- [j6]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): 288-305 (2013) - [c34]H. K. Dai, Zhu Wang:
Mining Serial-Episode Rules Using Minimal Occurrences with Gap Constraint. ICCSA (1) 2013: 562-572
2000 – 2009
- 2008
- [j5]Jin Hwan Park, H. K. Dai:
Reconfigurable hardware solution to parallel prefix computation. J. Supercomput. 43(1): 43-58 (2008) - [c33]H. K. Dai, Kyu-Young Whang, Hung-Chi Su:
Locality of Corner Transformation for Multidimensional Spatial Access Methods. FICS 2008: 133-148 - 2007
- [j4]Modan K. Das, Ho-Kwok Dai:
A survey of DNA motif finding algorithms. BMC Bioinform. 8(S-7) (2007) - [c32]H. K. Dai, Y. Du:
On the Bounded-Delay Minimum-Cost Path Problem of Quality-of-Service Routing. ICCCN 2007: 384-390 - [c31]H. K. Dai, C.-T. Yeh:
Content-Based Image Watermarking Via Public-Key Cryptosystems. ICCSA (1) 2007: 937-950 - [c30]H. K. Dai, C.-T. Yeh, Zhu Wang:
On Digital Watermarking via Public-Key Cryptosystems. PDPTA 2007: 822-828 - 2006
- [c29]Ho-Kwok Dai, Hung-Chi Su:
A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences. LATIN 2006: 337-348 - 2005
- [c28]H. K. Dai, G. Wang:
Mining a Class of Complex Episodes in Event Sequences. AAIM 2005: 460-471 - [c27]C. C. Chiang, H. K. Dai:
On the Minimum-Cost Set-Covering Problem. PDPTA 2005: 1199-1205 - 2004
- [j3]Jing Peng, Douglas R. Heisterkamp, H. K. Dai:
Adaptive Quasiconformal Kernel Nearest Neighbor Classification. IEEE Trans. Pattern Anal. Mach. Intell. 26(5): 656-661 (2004) - [c26]H. K. Dai, Hung-Chi Su:
On p-Norm Based Locality Measures of Space-Filling Curves. ISAAC 2004: 364-376 - [c25]K. H. Choi, H. K. Dai:
A Marking Scheme Using Huffman Codes for IP Traceback. ISPAN 2004: 421-428 - [c24]H. K. Dai, Xi-Wen Zhang:
Improved Linear Expected-Time Algorithms for Computing Maxima. LATIN 2004: 181-192 - [c23]H. K. Dai, Z. Li, Hung-Chi Su:
An Empirical Study of Bounded Delay Constrained Bandwidth Routing. PDPTA 2004: 973-979 - [c22]H. K. Dai, A. Raju, Venkatesh Sarangan:
Routing in Mobile Ad Hoc Networks Based on Block Decomposition. PDPTA 2004: 986-994 - 2003
- [j2]Jing Peng, Douglas R. Heisterkamp, H. K. Dai:
LDA/SVM driven nearest neighbor classification. IEEE Trans. Neural Networks 14(4): 940-942 (2003) - [c21]Ho-Kwok Dai, Hung-Chi Su:
Approximation and Analytical Studies of Inter-clustering Performances of Space-Filling Curves. DRW 2003: 53-68 - [c20]H. K. Dai, Hung-Chi Su:
On the Locality Properties of Space-Filling Curves. ISAAC 2003: 385-394 - [c19]H. K. Dai, Hung-Chi Su:
An Empirical Study of p-Norm Based Locality Measures of Space-Filling Curves. PDPTA 2003: 1434-1440 - [c18]Andy Auyeung, Iker Gondra, H. K. Dai:
Multi-Heuristic List Scheduling Genetic Algorithms for Task Scheduling. SAC 2003: 721-724 - 2002
- [c17]Jing Peng, Douglas R. Heisterkamp, H. K. Dai:
Adaptive Kernel Metric Nearest Neighbor Classification. ICPR (3) 2002: 33-36 - [c16]H. K. Dai, K. C. Su:
Locality Performance of Some Mesh-indexings. PDPTA 2002: 1337-1343 - 2001
- [c15]H. K. Dai:
Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences. COCOON 2001: 228-236 - [c14]Jing Peng, Douglas R. Heisterkamp, H. K. Dai:
LDA/SVM Driven Nearest Neighbor Classification. CVPR (1) 2001: 58- - [c13]Douglas R. Heisterkamp, Jing Peng, H. K. Dai:
Adaptive Quasiconformal Kernel Metric for Image Retrieval. CVPR (2) 2001: 388-393 - 2000
- [c12]Douglas R. Heisterkamp, Jing Peng, H. K. Dai:
Feature Relevance Learning with Query Shifting for Content-Based Image Retrieval. ICPR 2000: 4250-4253 - [c11]H. K. Dai, Shinji Fujino:
On Designing Constrained Local Access Network. ISPAN 2000: 167-177 - [c10]H. K. Dai, Shinji Fujino:
Improving the Esau-Williams Algorithm for Designing Local Access Networks. PDPTA 2000
1990 – 1999
- 1999
- [c9]H. K. Dai:
Deciding Strictly Non-Blocking Generalized-Concentration Properties with Constrained Network Parameters. ISPAN 1999: 22-27 - [c8]H. K. Dai:
On Structural Modification Learning Algorithms. PDPTA 1999: 2856-2862 - 1997
- [j1]H. K. Dai:
The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties. Int. J. Found. Comput. Sci. 8(3): 237-252 (1997) - 1996
- [c7]H. K. Dai, Kevin E. Flannery:
Improved Length Lower Bounds for Reflecting Sequences. COCOON 1996: 56-67 - [c6]H. K. Dai:
The Size Complexity of Strictly Non-blocking Fixed Ratio Concentrators with Constant Depth. Euro-Par, Vol. I 1996: 234-242 - 1995
- [c5]John Folland, H. K. Dai:
Warpnet: Neural Network with a Parabolic Warp. Parallel and Distributed Computing and Systems 1995: 99-102 - 1994
- [c4]H. K. Dai:
An Improvement in the Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentration Networks. PARLE 1994: 214-225 - 1993
- [c3]H. K. Dai:
Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentrators. ICCI 1993: 41-47 - [c2]H. K. Dai:
The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties with Small Depth. ICCI 1993: 48-54 - [c1]H. K. Dai:
On Synchronous Strictly Non-Blocking Concentrators and Generalized-Concentrators. IPPS 1993: 406-412
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
