Minh Vu Thai Pham
Minh Vu Thai Pham has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Cuong Chi Le
FPT Software AI Center, Hanoi, Vietnam
2 shared publications - Huy N. Phan
FPT Software AI Center, Hanoi, Vietnam
2 shared publications - Nhat Hoang Phan
Nanyang technological university, Singapore, Singapore
2 shared publications - Tien N. Nguyen
University of Texas at Dallas, Dallas, USA
2 shared publications - Jafreezal Jaafar
Department of Computer and Information Sciences, Universiti Teknologi PETRONAS (UTP), Seri Iskandar, Perak, Malaysia
1 shared publication - Nghi D. Q. Bui
Salesforce Research Asia
1 shared publication
Latest Publications
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1288-1300
TestWeaver: Execution-aware, Feedback-driven Regression Testing Generation with Large Language Models
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1288-1300
Open AccessTestWeaver: Execution-aware, Feedback-driven Regression Testing Generation with Large Language Models
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 349-361
Synthetic Repo-level Bug Dataset for Training Automated Program Repair Models
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 349-361
Open AccessSynthetic Repo-level Bug Dataset for Training Automated Program Repair Models
- Open Access
- 20 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 30094-30108
RelaHash: Deep Hashing With Relative Position
Deep hashing has been widely used as a solution to encoding binary hash code for approximating nearest neighbor problem. It has been showing superior performance in terms of its ability to index high-level features by learning compact binary code. Many recent state-of-the-art deep hashing methods often use multiple loss terms at once, thus introducing optimization difficulty and may result in sub-optimal hash codes. OrthoHash [1] was proposed to replace those losses with just a single loss function. However, the quantization error minimization problem in OrthoHash is still not addressed effectively. In this paper, we take one step further - propose a single-loss model that can effectively minimize the quantization error without explicit loss terms. Specifically, we introduce a new way to measure the similarity between the relaxed codes with centroids, called relative similarity. The relative similarity is the similarity between the relative position representation of continuous codes and the normalized centroids. The resulting model outperforms many state-of-the-art deep hashing models on popular benchmark datasets.
- 20 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 30094-30108
Open AccessRelaHash: Deep Hashing With Relative Position
Deep hashing has been widely used as a solution to encoding binary hash code for approximating nearest neighbor problem. It has been showing superior performance in terms of its ability to index high-level features by learning compact binary code. Many recent state-of-the-art deep hashing methods often use multiple loss terms at once, thus introducing optimization difficulty and may result in sub-optimal hash codes. OrthoHash [1] was proposed to replace those losses with just a single loss function. However, the quantization error minimization problem in OrthoHash is still not addressed effectively. In this paper, we take one step further - propose a single-loss model that can effectively minimize the quantization error without explicit loss terms. Specifically, we introduce a new way to measure the similarity between the relaxed codes with centroids, called relative similarity. The relative similarity is the similarity between the relative position representation of continuous codes and the normalized centroids. The resulting model outperforms many state-of-the-art deep hashing models on popular benchmark datasets.