H. K. Dai

According to our database1, H. K. Dai authored at least 54 papers between 1993 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Extremal Problem with Network-Diameter and -Minimum-Degree for Distributed Function Computation.
SN Comput. Sci., 2020

Lower-Bound Study for Function Computation in Distributed Networks via Vertex-Eccentricity.
SN Comput. Sci., 2020

2019
Two parallel algorithms for finding all minimal maximum subsequences.
J. Comput. Syst. Sci., 2019

The complexity of cluster-connectivity of wireless sensor networks.
Int. J. Bus. Intell. Data Min., 2019

Lower Bound on Network Diameter for Distributed Function Computation.
Proceedings of the Future Data and Security Engineering - 6th International Conference, 2019

Finding All Minimal Maximum Subsequences in Parallel.
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.
Proceedings of the Ninth International Symposium on Information and Communication Technology, 2018

Lower Bound for Function Computation in Distributed Networks.
Proceedings of the Future Data and Security Engineering - 5th International Conference, 2018

2017
On Transformation-Based Spatial Access Methods with Monotone Norms.
Proceedings of the Future Data and Security Engineering - 4th International Conference, 2017

2016
On the Cluster-Connectivity of Wireless Sensor Networks.
Proceedings of the Computational Science and Its Applications - ICCSA 2016, 2016

Norm-Based Locality Measures of Two-Dimensional Hilbert Curves.
Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015
Length lower bounds for reflecting sequences and universal traversal sequences.
Discret. Math., 2015

A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk.
Proceedings of the Language and Automata Theory and Applications, 2015

Distance Metric on Multidimensional Spatial Objects.
Proceedings of the 15th International Conference on Computational Science and Its Applications, 2015

2014
Clustering Performance of 3-Dimensional Hilbert Curves.
Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013
Data mining of serial-episode association rules using gap-constrained minimal occurrences.
Int. J. Bus. Intell. Data Min., 2013

Mining Serial-Episode Rules Using Minimal Occurrences with Gap Constraint.
Proceedings of the Computational Science and Its Applications - ICCSA 2013, 2013

2008
Reconfigurable hardware solution to parallel prefix computation.
J. Supercomput., 2008

Locality of Corner Transformation for Multidimensional Spatial Access Methods.
Electron. Notes Theor. Comput. Sci., 2008

2007
A survey of DNA motif finding algorithms.
BMC Bioinform., 2007

On Digital Watermarking via Public-Key Cryptosystems.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2007

Content-Based Image Watermarking Via Public-Key Cryptosystems.
Proceedings of the Computational Science and Its Applications, 2007

On the Bounded-Delay Minimum-Cost Path Problem of Quality-of-Service Routing.
Proceedings of the 16th International Conference on Computer Communications and Networks, 2007

2006
A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005
On the Minimum-Cost Set-Covering Problem.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005

Mining a Class of Complex Episodes in Event Sequences.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004
Adaptive Quasiconformal Kernel Nearest Neighbor Classification.
IEEE Trans. Pattern Anal. Mach. Intell., 2004

Routing in Mobile Ad Hoc Networks Based on Block Decomposition.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

An Empirical Study of Bounded Delay Constrained Bandwidth Routing.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

Improved Linear Expected-Time Algorithms for Computing Maxima.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

A Marking Scheme Using Huffman Codes for IP Traceback.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

On p-Norm Based Locality Measures of Space-Filling Curves.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003
LDA/SVM driven nearest neighbor classification.
IEEE Trans. Neural Networks, 2003

Multi-Heuristic List Scheduling Genetic Algorithms for Task Scheduling.
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

An Empirical Study of p-Norm Based Locality Measures of Space-Filling Curves.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003

On the Locality Properties of Space-Filling Curves.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Approximation and Analytical Studies of Inter-clustering Performances of Space-Filling Curves.
Proceedings of the Discrete Random Walks, 2003

2002
Locality Performance of Some Mesh-indexings.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2002

Adaptive Kernel Metric Nearest Neighbor Classification.
Proceedings of the 16th International Conference on Pattern Recognition, 2002

2001
Adaptive Quasiconformal Kernel Metric for Image Retrieval.
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.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Improving the Esau-Williams Algorithm for Designing Local Access Networks.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

On Designing Constrained Local Access Network.
Proceedings of the 5th International Symposium on Parallel Architectures, 2000

Feature Relevance Learning with Query Shifting for Content-Based Image Retrieval.
Proceedings of the 15th International Conference on Pattern Recognition, 2000

1999
On Structural Modification Learning Algorithms.
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.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

1997
The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties.
Int. J. Found. Comput. Sci., 1997

1996
The Size Complexity of Strictly Non-blocking Fixed Ratio Concentrators with Constant Depth.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

Improved Length Lower Bounds for Reflecting Sequences.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
Warpnet: Neural Network with a Parabolic Warp.
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.
Proceedings of the PARLE '94: Parallel Architectures and Languages Europe, 1994

1993
On Synchronous Strictly Non-Blocking Concentrators and Generalized-Concentrators.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties with Small Depth.
Proceedings of the Computing and Information, 1993

Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentrators.
Proceedings of the Computing and Information, 1993


  Loading...