default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLe Hong Trang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Duong Duc Tin
, Thai Tieu Phuong, Le Hong Trang:
SERF-P: A Semi Supervised Approach via Enhancing Representative Features and Pseudo-Labeling. ICMVA 2024: 41-47- 2023
- [j9]Thanh An Phan, Thi Le Nguyen, Le Hong Trang, Raymond Chi-Wing Wong:
Finding shortest gentle paths on polyhedral terrains by the method of multiple shooting. J. Comput. Sci. 67: 101935 (2023) - [c17]Cam Le, Lam Pham, Nghia NVN, Truong Nguyen, Le Hong Trang:
A Robust and Low Complexity Deep Learning Model for Remote Sensing Image Classification. ICIIT 2023: 177-184 - [c16]Nguyen Van Duc, Hoang Huu Bach, Le Hong Trang:
An Improved Reverse Distillation Model for Unsupervised Anomaly Detection. IMCOM 2023: 1-6 - 2022
- [c15]Pham Van Ngoan, Le Hong Trang:
Deep and Wide Features for Face Anti-Spoofing. BDIOT 2022: 39-42 - [i2]Le Hong Trang, Thi Le Nguyen, Thanh An Phan:
Finding Approximately Convex Ropes in the Plane. CoRR abs/2201.06290 (2022) - [i1]Cam Le, Lam Pham, Nghia NVN, Truong Nguyen, Le Hong Trang:
A Robust and Low Complexity Deep Learning Model for Remote Sensing Image Classification. CoRR abs/2211.02820 (2022) - 2021
- [j8]Hind Bangui, Mouzhi Ge, Barbora Buhnova, Le Hong Trang:
Towards faster big data analytics for anti-jamming applications in vehicular ad-hoc network. Trans. Emerg. Telecommun. Technol. 32(10) (2021) - [j7]Hoang Huu Viet, Nguyen Thi Uyen, SeungGwan Lee, TaeChoong Chung, Le Hong Trang:
A max-conflicts based heuristic search for the stable marriage problem with ties and incomplete lists. J. Heuristics 27(3): 439-458 (2021) - [j6]Le Hong Trang, Tran Duong Huy, Anh-Ngoc Le:
Clustering helps to improve price prediction in online booking systems. Int. J. Web Inf. Syst. 17(1): 45-53 (2021) - [c14]Nguyen Thi Hong Anh, Do Ngoc Nhu Loan, Le Hong Trang:
One-Class Classification with Noise-Based Data Augmentation for Industrial Anomaly Detection. FDSE (CCIS Volume) 2021: 200-209 - 2020
- [j5]Hoang Huu Viet, Le Hong Trang, Le Pham Tuyen, TaeChoong Chung:
A shortlist-based bidirectional local search for the stable marriage problem. J. Exp. Theor. Artif. Intell. 32(1): 147-163 (2020) - [j4]Nguyen Le Hoang, Le Hong Trang, Tran Khanh Dang:
A Comparative Study of the Some Methods Used in Constructing Coresets for Clustering Large Datasets. SN Comput. Sci. 1(4): 215 (2020) - [c13]Le Hong Trang, Nguyen Phan Dang Khoa, Nguyen Minh Khoi:
Automatically Finding the Number of Clusters for Large Datasets based on Coresets. BDIOT 2020: 1-6 - [c12]Nguyen Thi Hong Anh, Nguyen Duy Viet Toan, Le Hong Trang:
A Convex Optimization Based Method for Color Image Reconstruction. FDSE (CCIS Volume) 2020: 373-383 - [c11]Le Hong Trang, Nguyen Le Hoang, Tran Khanh Dang:
A Farthest First Traversal based Sampling Algorithm for k-clustering. IMCOM 2020: 1-6
2010 – 2019
- 2019
- [c10]Le Hong Trang, Nguyen Thuy Hoa, Tran Van Hoai, Hoang Huu Viet:
Finding MAX-SMTI for Stable Marriage with Ties and Bounded Preference Lists. ACOMP 2019: 107-111 - [c9]Le Hong Trang, Hind Bangui, Mouzhi Ge, Barbora Buhnova:
Scaling Big Data Applications in Smart City with Coresets. DATA 2019: 357-363 - [c8]Nguyen Le Hoang, Tran Khanh Dang, Le Hong Trang:
A Comparative Study of the Use of Coresets for Clustering Large Datasets. FDSE 2019: 45-55 - [c7]Le Hong Trang, Hoang Huu Viet, Tran Van Hoai, Tran Xuan Hao:
A Searching for Strongly Egalitarian and Sex-Equal Stable Matchings. IMCOM 2019: 1100-1111 - [c6]Hoang Huu Viet, Nguyen Thi Uyen, Pham Tra My, Son Thanh Cao, Le Hong Trang:
A Max-Min Conflict Algorithm for the Stable Marriage Problem. PKAW 2019: 44-53 - 2018
- [c5]Le Hong Trang, Pham Van Ngoan, Nguyen Van Duc:
A Sample-Based Algorithm for Visual Assessment of Cluster Tendency (VAT) with Large Datasets. FDSE 2018: 145-157 - 2017
- [c4]Le Hong Trang, Quynh Chi Truong, Tran Khanh Dang:
An Iterative Algorithm for Computing Shortest Paths Through Line Segments in 3D. FDSE 2017: 73-84 - 2016
- [j3]Le Hong Trang, Attila Kozma, Thanh An Phan, Moritz Diehl:
A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints. Optim. Methods Softw. 31(1): 187-203 (2016) - [c3]Hoang Huu Viet, Le Hong Trang, SeungGwan Lee, TaeChoong Chung:
A Bidirectional Local Search for the Stable Marriage Problem. ACOMP 2016: 18-24 - [c2]Le Hong Trang, Hoang Huu Viet, TaeChoong Chung:
Finding "optimal" stable marriages with ties via local search. KSE 2016: 61-66 - [c1]Hoang Huu Viet, Le Hong Trang, SeungGwan Lee, TaeChoong Chung:
An Empirical Local Search for the Stable Marriage Problem. PRICAI 2016: 556-564 - 2014
- [j2]Thanh An Phan, Nguyen Ngoc Hai, Tran Van Hoai, Le Hong Trang:
On the Performance of Triangulation-Based Multiple Shooting Method for 2D Geometric Shortest Path Problems. Trans. Large Scale Data Knowl. Centered Syst. 16: 45-56 (2014) - 2012
- [j1]Thanh An Phan, Le Hong Trang:
A parallel algorithm based on convexity for the computing of Delaunay tessellation. Numer. Algorithms 59(3): 347-357 (2012)
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-10-30 20:32 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:
