dblp.uni-trier.dewww.uni-trier.de

Kai-Pui Lam Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
11EETerrence S. T. Mak, Peter Y. K. Cheung, Wayne Luk, Kai-Pui Lam: A DP-network for optimal dynamic routing in network-on-chip. CODES+ISSS 2009: 119-128
2007
10EETerrence S. T. Mak, Kai-Pui Lam, H. S. Ng, G. Rachmuth, C.-S. Poon: A Current-Mode Analog Circuit for Reinforcement Learning Problems. ISCAS 2007: 1301-1304
9EETerrence S. T. Mak, N. Pete Sedcole, Peter Y. K. Cheung, Wayne Luk, Kai-Pui Lam: A Hybrid Analog-Digital Routing Network for NoC Dynamic Routing. NOCS 2007: 173-182
2006
8EEH. S. Ng, Kai-Pui Lam: How Does Sample Size Affect GARCH Models? JCIS 2006
2004
7EETerrence S. T. Mak, Kai-Pui Lam: Embedded Computation of Maximum-Likelihood Phylogeny Inference Using Platform FPGA. CSB 2004: 512-514
6EETerrence S. T. Mak, Kai-Pui Lam: FPGA-Based Computation for Maximum Likelihood Phylogenetic Tree Evaluation. FPL 2004: 1076-1079
5EETerrence S. T. Mak, Kai-Pui Lam: On Computing Maximum Likelihood Phylogeny Using FPGA p. FPL 2004: 1188
2003
4EETerrence S. T. Mak, Kai-Pui Lam: High Speed GAML-based Phylogenetic Tree Reconstruction Using HW/SW Codesign. CSB 2003: 470-473
3EEH. S. Ng, Sui-Tung Mak, Kai-Pui Lam: Field programmable gate arrays and analog implementation of BRIN for optimization problems. ISCAS (5) 2003: 73-76
2002
2EEKai-Pui Lam, Sui-Tung Mak: On Computing Transitive-Closure Equivalence Sets Using a Hybrid GA-DP Approach. FPL 2002: 935-944
1EEKi Chan, Boon Toh Low, Wai Lam, Kai-Pui Lam: Extracting Causation Knowledge from Natural Language Texts. PAKDD 2002: 555-560

Coauthor Index

1Ki Chan [1]
2Peter Y. K. Cheung [9] [11]
3Wai Lam [1]
4Boon Toh Low [1]
5Wayne Luk [9] [11]
6Sui-Tung Mak [2] [3]
7Terrence S. T. Mak [4] [5] [6] [7] [9] [10] [11]
8H. S. Ng [3] [8] [10]
9C.-S. Poon [10]
10G. Rachmuth [10]
11N. Pete Sedcole [9]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)