Demo Data from SIGIR 2026 / reviewers in the wild / expert
Bohui Wu
dblp:427/6339
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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 |
Cloud and datacenter computing · 50% GPUs and heterogeneous computing · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
GPUs and heterogeneous computing
GPU resource management |
1.0 | 1 | 2026 | Enabling Low-Latency, GPU-Efficient Serverless Inference with Model Swapping · ACM Trans. Archit. Code Optim. 2026 |
GPUs and heterogeneous computing
GPU sharing |
1.0 | 1 | 2026 | Enabling Low-Latency, GPU-Efficient Serverless Inference with Model Swapping · ACM Trans. Archit. Code Optim. 2026 |
Cloud and datacenter computing
inference serving |
1.0 | 1 | 2026 | Enabling Low-Latency, GPU-Efficient Serverless Inference with Model Swapping · ACM Trans. Archit. Code Optim. 2026 |
Cloud and datacenter computing
serverless computing |
1.0 | 1 | 2026 | Enabling Low-Latency, GPU-Efficient Serverless Inference with Model Swapping · ACM Trans. Archit. Code Optim. 2026 |
Methods — techniques the papers use, named apart from their topics
request scheduling · 1.0late binding · 1.0GPU runtime sharing · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Graph-based radical structure tree representation for zero-shot Chinese character recognition
Yongsheng Dong 0002, Bohui Wu, Jinwen Ma, Xuelong Li 0001 |
Pattern Recognit. | 2 |
| 2026 | RadSimLoss: Radical Similarity-Guided Loss for Zero-Shot Chinese Character RecognitionabstractZero-shot Chinese character recognition is an important topic in the signal processing field. Existing glyph-based methods achieve competitive performance by considering glyph similarity, but they incur substantial computational overhead due to the need for a visual encoder. Recognition methods based on ideographic description sequences (IDS) are more efficient, yet they do not account for inter-character similarity during representation learning, which may limit recognition performance. To alleviate this limitation, we propose a radical similarity–guided loss (RadSimLoss) for zero-shot Chinese character recognition. The RadSimLoss computes pairwise similarities between characters from their IDS, replacing glyph-based similarity, and incorporates them into the training objective. Experimental results on handwritten, scene, printed artistic, and ancient Chinese character datasets show that our proposed RadSimLoss is effective and outperforms a series of state-of-the-art approaches. Bohui Wu, Yongsheng Dong 0001 |
IEEE Signal Process. Lett. | 1 |
| 2026 | Enabling Low-Latency, GPU-Efficient Serverless Inference with Model SwappingabstractServerless computing offers a compelling cloud model for online inference services. However, existing serverless platforms lack efficient support for GPUs, hindering their ability to deliver high-performance inference. In this article, we present Torpor , a serverless platform for GPU-efficient, low-latency inference. To enable efficient sharing of a node’s GPUs among numerous inference functions, Torpor maintains models in main memory and dynamically swaps them onto GPUs upon request arrivals (i.e., late binding with model swapping). Torpor uses various techniques, including asynchronous API redirection, GPU runtime sharing, pipelined model execution, and efficient GPU memory management, to minimize latency overhead caused by model swapping. Additionally, we design an interference-aware request scheduling algorithm that utilizes high-speed GPU interconnects to meet latency service-level objectives (SLOs) for individual inference functions. We have implemented Torpor and evaluated its performance in a production environment. Utilizing late binding and model swapping, Torpor can concurrently serve hundreds of inference functions on a worker node with 4 GPUs, while achieving latency performance comparable to native execution, where each model is cached exclusively on a GPU. Pilot deployment in a leading commercial serverless cloud shows that Torpor reduces the GPU provisioning cost by 70% and 65% for users and the platform, respectively. Minchen Yu, Bohui Wu, Haoxuan Yu, Wei Wang 0030, Ruichuan Chen, Dapeng Nie |
ACM Trans. Archit. Code Optim. | 3 |