Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Yuk Hei Chan"'
Autor:
Jingxuan Tai, Lin Wang, Wai Shan Chan, Jiahui Cheng, Yuk Hei Chan, Marianne M. Lee, Michael K. Chan
Publikováno v:
Journal of the American Chemical Society. 145:10249-10258
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee82cdb8facce92fd6faa487390ae4f1
https://doi.org/10.1021/jacs.3c01291
https://doi.org/10.1021/jacs.3c01291
Autor:
YUK HEI CHAN1 yhchan@cse.cuhk.edu.hk, WAI SHING FUNG1 wsfung@cse.cuhk.edu.hk, LAP CHI LAU1 chi@cse.cuhk.edu.hk, CHUN KONG YUNG1 ckyung@cse.cuhk.edu.hk
Publikováno v:
SIAM Journal on Computing. 2011, Vol. 40 Issue 4, p953-980. 28p.
Publikováno v:
FOCS
Given a complete undirected graph, a cost function on edges, and a degree bound $B$, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum degree $B$ satisfying given connectivity requirements. Even for a si
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07c544d45cdf6e098a15b7fdb7425bba
https://doi.org/10.1137/090746495
https://doi.org/10.1137/090746495
Autor:
Lap Chi Lau, Yuk Hei Chan
Publikováno v:
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms.
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theory with various applications. The best known approximation algorithms f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a00876bf4570d4f14c4afc6b0db19162
https://doi.org/10.1137/1.9781611973075.122
https://doi.org/10.1137/1.9781611973075.122
Publikováno v:
FPGA
FPL
FPL
Logical effort (LE) is a linear technique for modelling the delay of a circuit in a technology independent manner. It offers the potential to simplify delay models for FPGAs and gain more insight into how the parameters affect the result. In this pap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c106ec575de05dbc4d31bd4513e2d97b
https://doi.org/10.1145/1344671.1344710
https://doi.org/10.1145/1344671.1344710