default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKhiem Le
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Khiem Le, Long Ho, Cuong Do, Danh Le Phuoc, Kok-Seng Wong:
Efficiently Assemble Normalization Layers and Regularization for Federated Domain Generalization. CVPR 2024: 6027-6036- [i6]Khiem Le, Nhan Luong-Ha, Manh Nguyen-Duc, Danh Le Phuoc, Cuong Do
, Kok-Seng Wong:
Exploring the Practicality of Federated Learning: A Survey Towards the Communication Perspective. CoRR abs/2405.20431 (2024) - [i5]Khiem Le, Zhichun Guo, Kaiwen Dong, Xiaobao Huang, Bozhao Nan, Roshni G. Iyer, Xiangliang Zhang, Olaf Wiest, Wei Wang, Nitesh V. Chawla:
MolX: Enhancing Large Language Models for Molecular Learning with A Multi-Modal Extension. CoRR abs/2406.06777 (2024) - [i4]Khiem Le, Nitesh V. Chawla:
Utilizing Large Language Models in an iterative paradigm with Domain feedback for Zero-shot Molecule optimization. CoRR abs/2410.13147 (2024) - 2023
- [c5]Thua Nguyen, Thuyen Tran Doan, Khiem Le, Tien Do, Thanh Duc Ngo, Duy-Dinh Le:
Information Extraction from Rich Text Images with RoBERTa and LION Optimizer. MAPR 2023: 1-6 - [c4]Sieu Tran, Duc Minh Nguyen, Triet Huynh Minh Nguyen, Danh Phuc Ngo, Thu Minh Nguyen, Hao Vo, Khiem Le, Tien Do, Thanh Duc Ngo:
Diverse Search Methods and Multi-Modal Fusion for High-Performance Video Retrieval. SoICT 2023: 997-1002 - [i3]Giang Do, Khiem Le, Quang Pham, TrungTin Nguyen, Thanh-Nam Doan, Bint T. Nguyen, Chenghao Liu, Savitha Ramasamy, Xiaoli Li, Steven C. H. Hoi:
HyperRouter: Towards Efficient Training and Inference of Sparse Mixture of Experts. CoRR abs/2312.07035 (2023) - 2022
- [c3]Khanh Ho, Vu Xuan Dinh, Hong-Quang Nguyen, Khiem Le, Khang Dinh Tran, Tien Do, Tien-Dung Mai, Thanh Duc Ngo, Duy-Dinh Le:
UIT at VBS 2022: An Unified and Interactive Video Retrieval System with Temporal Search. MMM (2) 2022: 556-561
2000 – 2009
- 2008
- [c2]Yogesh Swami, Khiem Le, Shashikant Maheshwari, Naveen Kakani:
Cross-layer optimization of transport protocols over wireless networks. ISWPC 2008: 241-245 - 2002
- [i2]Zhigang Liu, Khiem Le:
Zero-byte Support for Bidirectional Reliable Mode (R-mode) in Extended Link-Layer Assisted RObust Header Compression (ROHC) Profile. RFC 3408: 1-7 (2002) - 2001
- [i1]Carsten Bormann, Carsten Burmeister, Mikael Degermark, Hideaki Fukushima, Hans Hannu, Lars-Erik Jonsson, Rolf Hakenberg, Tmima Koren, Khiem Le, Zhigang Liu, Anton Martensson, Akihiro Miyazaki, Krister Svanbro, Thomas Wiebke, Takeshi Yoshimura, Haihong Zheng:
RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed. RFC 3095: 1-168 (2001) - 2000
- [c1]Khiem Le, Chris Clanton, Zhigang Liu, Haihong Zheng:
Efficient and robust header compression for real-time services. WCNC 2000: 924-928
1990 – 1999
- 1999
- [j1]Stefano M. Faccin, Liangchi Hsu, Rajeev Koodli, Khiem Le, René Purnadi:
GPRS and IS-136 integration for flexible network and services evolution. IEEE Wirel. Commun. 6(3): 48-54 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 23:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
