Demo Data from EDBT 2026 / reviewers in the wild / expert
Quang Hieu Vo
dblp:357/7336
· DBLP profile ↗
5ranked-venue papers
2as first author
5since 2021 · last 2026
0000-0003-3758-0902ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Computer networks · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Hardware accelerators and domain-specific architectures · 100% | |
| Artificial intelligence
1 paper |
Efficient and distributed learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
model compression |
0.7 | 1 | 2023 | MST-compression: Compressing and Accelerating Binary Neural Networks with Minimum Spanning Tree · ICCV 2023 |
Hardware accelerators and domain-specific architectures › machine learning accelerator › neural network accelerator
binary neural network accelerator |
0.7 | 1 | 2023 | MST-compression: Compressing and Accelerating Binary Neural Networks with Minimum Spanning Tree · ICCV 2023 |
Hardware accelerators and domain-specific architectures › machine learning accelerator
neural network accelerator |
0.7 | 1 | 2023 | MST-compression: Compressing and Accelerating Binary Neural Networks with Minimum Spanning Tree · ICCV 2023 |
Methods — techniques the papers use, named apart from their topics
minimum spanning tree · 1.3learning-based channel reordering · 1.3XNOR operations · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Efficient dataset condensation with learnable color representation and subset matching
Linh-Tam Tran, Quang Hieu Vo, Maryam Qamar, Chaoning Zhang, Hui Yong Kim, Sung-Ho Bae |
Knowl. Based Syst. | 2 |
| 2025 | Cyber Attacks Prevention Toward Prosumer-Based EV Charging Stations: An Edge-Assisted Federated Prototype Knowledge Distillation ApproachabstractIn this paper, cyber-attack prevention for the prosumer-based electric vehicle (EV) charging stations (EVCSs) is investigated, which covers two aspects: 1) cyber-attack detection on prosumers’ network traffic (NT) data, and 2) cyber-attack intervention. To establish an effective prevention mechanism, several challenges need to be tackled, for instance, the NT data per prosumer may be non-independent and identically distributed (non-IID), and the boundary between benign and malicious traffic becomes blurred. To this end, we propose an edge-assisted federated prototype knowledge distillation (E-FPKD) approach, where each client is deployed on a dedicated local edge server (DLES) and can report its availability for joining the federated learning (FL) process. Prior to the E-FPKD approach, to enhance accuracy, the Pearson Correlation Coefficient is adopted for feature selection. Regarding the proposed E-FPKD approach, we integrate the knowledge distillation and prototype aggregation technique into FL to deal with the non-IID challenge. To address the boundary issue, instead of directly calculating the distance between benign and malicious traffic, we consider maximizing the overall detection correctness of all prosumers (ODC), which can mitigate the computational cost compared with the former way. After detection, a rule-based method will be triggered at each DLES for cyber-attack intervention. Experimental analysis demonstrates that the proposed E-FPKD can achieve the largest ODC on NSL-KDD, UNSW-NB15, and IoTID20 datasets in both binary and multi-class classification, compared with baselines. For instance, the ODC for IoTID20 obtained via the proposed method is separately 0.3782% and 4.4471% greater than FedProto and FedAU in multi-class classification. Luyao Zou, Quang Hieu Vo, Kitae Kim 0001, Huy Q. Le, Chu Myaet Thwal, Chaoning Zhang, Choong Seon Hong |
IEEE Trans. Netw. Serv. Manag. | 2 |
| 2023 | Distribution Matching with Multi-formation Function for Dataset Distillation
Quang Hieu Vo, Choong Seon Hong |
APNOMS | 1 |
| 2023 | MST-compression: Compressing and Accelerating Binary Neural Networks with Minimum Spanning TreeabstractBinary neural networks (BNNs) have been widely adopted to reduce the computational cost and memory storage on edge-computing devices by using one-bit representation for activations and weights. However, as neural networks become wider/deeper to improve accuracy and meet practical requirements, the computational burden remains a significant challenge even on the binary version. To address these issues, this paper proposes a novel method called Minimum Spanning Tree (MST) compression that learns to compress and accelerate BNNs. The proposed architecture leverages an observation from previous works that an output channel in a binary convolution can be computed using another output channel and XNOR operations with weights that differ from the weights of the reused channel. We first construct a fully connected graph with vertices corresponding to output channels, where the distance between two vertices is the number of different values between the weight sets used for these outputs. Then, the MST of the graph with the minimum depth is proposed to reorder output calculations, aiming to reduce computational cost and latency. Moreover, we propose a new learning algorithm to reduce the total MST distance during training. Experimental results on benchmark models demonstrate that our method achieves significant compression ratios with negligible accuracy drops, making it a promising approach for resource-constrained edge-computing devices. Quang Hieu Vo, Linh-Tam Tran, Sung-Ho Bae, Choong Seon Hong |
ICCV | 1 |
| 2023 | Runtime Testability on Autonomous SystemabstractMore than ever, autonomous systems that are critical to everyday life, social infrastructure, and social security are increasingly dependent on sophisticated hardware computer systems. As the computer hardware systems become increasingly complex and semiconductor manufacturing technology becomes continuously miniaturized (especially in several nanometer technologies), there is a corresponding increased vulnerability to system malfunction caused by runtime hardware defects. Detecting defects that will be generated in postdeployment time is impossible in the predeployment verification. This is the reason why some lifetime testabilities are necessary, especially for autonomous systems requiring extremely high-reliable functionalities. This article proposes a hardware architecture that extends the pre-deployment mass production verification (such as the scan-test) to the lifetime of the hardware systems,to guarantee the mass production verification level integrity for the hardware systems in their lifetime. In addition, this article explains how to recover hardware functionalities compromised by runtime defects. Quang Hieu Vo, Choong Seon Hong |
IEEE Trans. Reliab. | 2 |