default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDuy Khuong Nguyen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c11]Tan M. Nguyen, Tam Nguyen, Long Bui, Hai Do, Duy Khuong Nguyen, Dung D. Le
, Hung Tran-The, Nhat Ho, Stanley J. Osher, Richard G. Baraniuk:
A Probabilistic Framework for Pruning Transformers Via a Finite Admixture of Keys. ICASSP 2023: 1-5- [c10]Khanh-Tung Tran, Truong Hoang, Duy Khuong Nguyen, Hoang D. Nguyen, Xuan-Son Vu:
Personalization for Robust Voice Pathology Detection in Sound Waves. INTERSPEECH 2023: 1708-1712 - [i3]Ngoc-Dung Do, Truong Son Hy, Duy Khuong Nguyen:
Sparsity exploitation via discovering graphical models in multi-variate time-series forecasting. CoRR abs/2306.17090 (2023) - 2022
- [c9]Tam Minh Nguyen, Tan Minh Nguyen, Dung D. D. Le, Duy Khuong Nguyen, Viet-Anh Tran, Richard G. Baraniuk, Nhat Ho, Stanley J. Osher:
Improving Transformers with Probabilistic Attention Keys. ICML 2022: 16595-16621 - [c8]Tan Nguyen, Tam Nguyen, Hai Do, Khai Nguyen, Vishwanath Saragadam, Minh Pham, Duy Khuong Nguyen, Nhat Ho, Stanley J. Osher:
Improving Transformer with an Admixture of Attention Heads. NeurIPS 2022
2010 – 2019
- 2017
- [j3]Duy Khuong Nguyen, Tu Bao Ho:
Accelerated anti-lopsided algorithm for nonnegative least squares. Int. J. Data Sci. Anal. 3(1): 23-34 (2017) - [j2]Duy Khuong Nguyen, Tu Bao Ho:
Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization. J. Glob. Optim. 68(2): 307-328 (2017) - 2016
- [c7]Duy Khuong Nguyen, Quoc Tran-Dinh, Tu Bao Ho:
Simplicial Nonnegative Matrix Tri-factorization: Fast Guaranteed Parallel Algorithm. ICONIP (2) 2016: 117-125 - [i2]Duy Khuong Nguyen, Tu Bao Ho:
Fast Parallel Randomized Algorithm for Nonnegative Matrix Factorization with KL Divergence for Large Sparse Datasets. CoRR abs/1604.04026 (2016) - 2015
- [i1]Duy Khuong Nguyen, Tu Bao Ho:
Accelerated Parallel and Distributed Algorithm using Limited Internal Memory for Nonnegative Matrix Factorization. CoRR abs/1506.08938 (2015) - 2014
- [j1]Khoat Than, Tu Bao Ho, Duy Khuong Nguyen:
An effective framework for supervised dimension reduction. Neurocomputing 139: 397-407 (2014) - 2013
- [c6]Duy Khuong Nguyen, Khoat Than, Tu Bao Ho:
Simplicial nonnegative matrix factorization. RIVF 2013: 47-52 - 2012
- [c5]Khoat Than, Tu Bao Ho, Duy Khuong Nguyen, Pham Ngoc Khanh:
Supervised dimension reduction with topic models. ACML 2012: 395-410 - 2011
- [c4]Duy Khuong Nguyen, The Duy Bui, Thanh Ha Le:
Blur Estimation for Barcode Recognition in Out-of-Focus Images. PReMI 2011: 116-121
2000 – 2009
- 2009
- [c3]The Duy Bui, Duy Khuong Nguyen, Tien Dat Ngo:
Supervising an Unsupervised Neural Network. ACIIDS 2009: 307-312 - 2008
- [c2]Duy Khuong Nguyen, The Duy Bui:
Recognizing Vietnamese Online Handwritten Separated Characters. ALPIT 2008: 279-284 - [c1]Duy Khuong Nguyen, The Duy Bui:
On the problem of classifying Vietnamese online handwritten characters. ICARCV 2008: 803-808
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-06-17 00:44 CEST 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:
