default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Trinh Ngoc Hai
aka: Ngoc Hai Trinh
Ha Noi University of Science and Technology, Vietnam
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 22 matches
- 2024
- Dinh-Cuong Hoang, Phan Xuan Tan, Thu-Uyen Nguyen, Hai-Nam Pham, Chi-Minh Nguyen, Son-Anh Bui, Quang-Tri Duong, Van-Duc Vu, Van-Thiep Nguyen, Van-Hiep Duong, Ngoc-Anh Hoang, Khanh-Toan Phan, Duc-Thanh Tran, Ngoc-Trung Ho, Cong-Trinh Tran:
A Unified Framework for Depth-Assisted Monocular Object Pose Estimation. IEEE Access 12: 111723-111740 (2024) - Tran Ngoc Thang, Trinh Ngoc Hai:
Self-adaptive algorithms for quasiconvex programming and applications to machine learning. Comput. Appl. Math. 43(4): 249 (2024) - Quoc-Huy Trinh, Hai-Dang Nguyen, Bao-Tram Nguyen Ngoc, Debesh Jha, Ulas Bagci, Minh-Triet Tran:
SAM-EG: Segment Anything Model with Egde Guidance framework for efficient Polyp Segmentation. CoRR abs/2406.14819 (2024) - 2023
- Thi-Hong-Tham Tran, Hai-Nam Le, Ngoc-Anh Vu, Pham Minh Nghia, Tien-Hoa Nguyen, Quang-Kien Trinh:
LNA linearization solution for direct conversion receiver using under-sampling technique in reference receiver. Phys. Commun. 59: 102059 (2023) - Trong-Hieu Nguyen Mau, Quoc-Huy Trinh, Ngoc-Linh Nguyen-Ha, Tuong-Vy Truong-Thuy, Tuan-Anh Yang, Hai-Dang Nguyen, Ngoc-Thao Nguyen, Minh-Triet Tran:
Optimizing Sperm Detection and Tracking in Fluids with Equalize Class Representation Augmentation. MediaEval 2023 - 2022
- Ngoc-Anh Vu, Hai-Nam Le, Thi-Hong-Tham Tran, Quang-Kien Trinh:
A LUT-based scheme for LNA linearization in direct RF sampling receivers. Phys. Commun. 50: 101530 (2022) - Thang Tran Ngoc, Trinh Ngoc Hai:
Self-adaptive algorithms for quasiconvex programming and applications to machine learning. CoRR abs/2212.06379 (2022) - 2021
- Trinh Ngoc Hai:
A simple fork algorithm for solving pseudomonotone non-Lipschitz variational inequalities. Int. J. Comput. Math. 98(9): 1807-1820 (2021) - Pham Ky Anh, Trinh Ngoc Hai:
Dynamical system for solving bilevel variational inequalities. J. Glob. Optim. 80(4): 945-963 (2021) - Nguyen Ngoc Tram, Trinh Duc Nam, Truong Xuan Thanh, Tran Quang Do, Dinh Hong Thai, Vu Duy Hai:
A Method to Improve the Accuracy of the Bioelectrical Impedance Phase-Angle Measuring System. ACOMP 2021: 169-175 - 2020
- Trinh Ngoc Hai:
Convergence rate of a new projected-type algorithm solving non-Lipschitz equilibrium problems. Comput. Appl. Math. 39(2) (2020) - Trinh Ngoc Hai:
Error bounds and stability of the projection method for strongly pseudomonotone equilibrium problems. Int. J. Comput. Math. 97(12): 2516-2530 (2020) - Trinh Ngoc Hai:
Two modified extragradient algorithms for solving variational inequalities. J. Glob. Optim. 78(1): 91-106 (2020) - Trinh Ngoc Hai:
On gradient projection methods for strongly pseudomonotone variational inequalities without Lipschitz continuity. Optim. Lett. 14(5): 1177-1191 (2020) - 2019
- Trinh Ngoc Hai:
Self-adaptive ergodic algorithm for equilibrium problems over the fixed point set. Int. J. Comput. Math. 96(4): 853-863 (2019) - Pham Ky Anh, Trinh Ngoc Hai:
Novel self-adaptive algorithms for non-Lipschitz equilibrium problems with applications. J. Glob. Optim. 73(3): 637-657 (2019) - Trinh Ngoc Hai, Qung Thuy Le:
Contraction-Mapping Algorithm for the equilibrium Problem over the fixed Point Set of a nonexpansive Semigroup. Math. Model. Anal. 24(1): 43-61 (2019) - Ngoc-Anh Vu, Hai-Nam Le, Thi-Hong-Tham Tran, Quang-Kien Trinh:
Novel Distortion Compensation Scheme for Multichannel Direct RF Digitization Receiver. ISCIT 2019: 156-161 - 2017
- Jong Kyu Kim, Pham N. Anh, Trinh Ngoc Hai:
The Bruck's ergodic iteration method for the Ky Fan inequality over the fixed point set. Int. J. Comput. Math. 94(12): 2466-2480 (2017) - Le Quang Thuy, Trinh Ngoc Hai:
A Projected Subgradient Algorithm for Bilevel Equilibrium Problems and Applications. J. Optim. Theory Appl. 175(2): 411-431 (2017) - Pham Ky Anh, Ngoc Hai Trinh:
Splitting extragradient-like algorithms for strongly pseudomonotone equilibrium problems. Numer. Algorithms 76(1): 67-91 (2017) - 2016
- Pham N. Anh, Trinh Ngoc Hai, P. M. Tuan:
On ergodic algorithms for equilibrium problems. J. Glob. Optim. 64(1): 179-195 (2016)
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-09 19:15 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint