The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

H. K. Dai: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  27. On the Bounded-Delay Minimum-Cost Path Problem of Quality-of-Service Routing. [Citation Graph (, )][DBLP]


  28. On Digital Watermarking via Public-Key Cryptosystems. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002