 | 2008 |
|---|
| 29 |       | Jin Hwan Park,
H. K. Dai:
Reconfigurable hardware solution to parallel prefix computation.
The Journal of Supercomputing 43(1): 43-58 (2008) |
| 2007 |
|---|
| 28 | | H. K. Dai,
Y. Du:
On the Bounded-Delay Minimum-Cost Path Problem of Quality-of-Service Routing.
ICCCN 2007: 384-390 |
| 27 | | H. K. Dai,
C.-T. Yeh:
Content-Based Image Watermarking Via Public-Key Cryptosystems.
ICCSA (1) 2007: 937-950 |
| 26 |  | H. K. Dai,
C.-T. Yeh,
Z. Wang:
On Digital Watermarking via Public-Key Cryptosystems.
PDPTA 2007: 822-828 |
| 2005 |
|---|
| 25 | | H. K. Dai,
G. Wang:
Mining a Class of Complex Episodes in Event Sequences.
AAIM 2005: 460-471 |
| 24 | | C. C. Chiang,
H. K. Dai:
On the Minimum-Cost Set-Covering Problem.
PDPTA 2005: 1199-1205 |
| 2004 |
|---|
| 23 | | K. H. Choi,
H. K. Dai:
A Marking Scheme Using Huffman Codes for IP Traceback.
ISPAN 2004: 421-428 |
| 22 | | H. K. Dai,
Xi-Wen Zhang:
Improved Linear Expected-Time Algorithms for Computing Maxima.
LATIN 2004: 181-192 |
| 21 | | H. K. Dai,
A. Raju,
V. Sarangan:
Routing in Mobile Ad Hoc Networks Based on Block Decomposition.
PDPTA 2004: 986-994 |
| 20 | | 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) |
| 2003 |
|---|
| 19 | | Andy Auyeung,
Iker Gondra,
H. K. Dai:
Multi-Heuristic List Scheduling Genetic Algorithms for Task Scheduling.
SAC 2003: 721-724 |
| 2002 |
|---|
| 18 | | Jing Peng,
Douglas R. Heisterkamp,
H. K. Dai:
Adaptive Kernel Metric Nearest Neighbor Classification.
ICPR (3) 2002: 33-36 |
| 17 | | H. K. Dai,
K. C. Su:
Locality Performance of Some Mesh-indexings.
PDPTA 2002: 1337-1343 |
| 2001 |
|---|
| 16 | | H. K. Dai:
Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences.
COCOON 2001: 228-236 |
| 15 | | Jing Peng,
Douglas R. Heisterkamp,
H. K. Dai:
LDA/SVM Driven Nearest Neighbor Classification.
CVPR (1) 2001: 58- |
| 14 | | Douglas R. Heisterkamp,
Jing Peng,
H. K. Dai:
Adaptive Quasiconformal Kernel Metric for Image Retrieval.
CVPR (2) 2001: 388-393 |
| 2000 |
|---|
| 13 | | Douglas R. Heisterkamp,
Jing Peng,
H. K. Dai:
Feature Relevance Learning with Query Shifting for Content-Based Image Retrieval.
ICPR 2000: 4250-4253 |
| 12 | | H. K. Dai,
Shinji Fujino:
On Designing Constrained Local Access Network.
ISPAN 2000: 167-177 |
| 11 | | H. K. Dai,
Shinji Fujino:
Improving the Esau-Williams Algorithm for Designing Local Access Networks.
PDPTA 2000 |
| 1999 |
|---|
| 10 | | H. K. Dai:
Deciding Strictly Non-Blocking Generalized-Concentration Properties with Constrained Network Parameters.
ISPAN 1999: 22-27 |
| 9 | | H. K. Dai:
On Structural Modification Learning Algorithms.
PDPTA 1999: 2856-2862 |
| 1997 |
|---|
| 8 | | 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 |
|---|
| 7 | | H. K. Dai,
Kevin E. Flannery:
Improved Length Lower Bounds for Reflecting Sequences.
COCOON 1996: 56-67 |
| 6 | | H. K. Dai:
The Size Complexity of Strictly Non-blocking Fixed Ratio Concentrators with Constant Depth.
Euro-Par, Vol. I 1996: 234-242 |
| 1995 |
|---|
| 5 | | John Folland,
H. K. Dai:
Warpnet: Neural Network with a Parabolic Warp.
Parallel and Distributed Computing and Systems 1995: 99-102 |
| 1994 |
|---|
| 4 | | H. K. Dai:
An Improvement in the Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentration Networks.
PARLE 1994: 214-225 |
| 1993 |
|---|
| 3 | | H. K. Dai:
Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentrators.
ICCI 1993: 41-47 |
| 2 | | H. K. Dai:
The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties with Small Depth.
ICCI 1993: 48-54 |
| 1 | | H. K. Dai:
On Synchronous Strictly Non-Blocking Concentrators and Generalized-Concentrators.
IPPS 1993: 406-412 |
