Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dongjin Shin

dblp:216/3962 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2Systems, architecture and hardware · 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
2 papers
Deep learning architectures and training · 62% Efficient and distributed learning · 38%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures › machine learning accelerator
neural network accelerator
0.812024
ViT-slice: End-to-end Vision Transformer Accelerator with Bit-slice Algorithm · DAC 2024
Hardware accelerators and domain-specific architectures › machine learning accelerator › transformer accelerator
vision transformer accelerator
0.812024
ViT-slice: End-to-end Vision Transformer Accelerator with Bit-slice Algorithm · DAC 2024
Compilers and program optimization
deep learning compiler
0.412019
JANUS: Fast and Flexible Deep Learning via Symbolic Graph Execution of Imperative Programs · NSDI 2019
Machine learning › Efficient and distributed learning
model compression
0.212024
ViT-slice: End-to-end Vision Transformer Accelerator with Bit-slice Algorithm · DAC 2024

Methods — techniques the papers use, named apart from their topics

early skip · 1.5bit-slice dot product · 1.5trainable thresholds · 0.8trainable threshold · 0.8
YearPublicationVenuePosition
2025 A Nuclei-Focused Strategy for Automated Histopathology Grading of Renal Cell Carcinoma
abstract
The rising incidence of kidney cancer underscores the need for precise and reproducible diagnostic methods. In particular, renal cell carcinoma (RCC), the most prevalent type of kidney cancer, requires accurate nuclear grading for better prognostic prediction. Recent advances in deep learning have facilitated end-to-end diagnostic methods using contextual features in histopathological images. However, most existing methods focus only on image-level features or lack an effective process for aggregating nuclei prediction results, limiting their diagnostic accuracy. In this paper, we introduce a novel framework, Nuclei feature Assisted Patch-level RCC grading (NuAP-RCC), that leverages nuclei-level features for enhanced patch-level RCC grading. Our approach employs a nuclei-level RCC grading network to extract grade-aware features, which serve as node features in a graph. These node features are aggregated using graph neural networks to capture the morphological characteristics and distributions of the nuclei. The aggregated features are then combined with global image-level features extracted by convolutional neural networks, resulting in a final feature for accurate RCC grading. In addition, we present a new dataset for patch-level RCC grading. Experimental results demonstrate the superior accuracy and generalizability of NuAP-RCC across datasets from different medical institutions, achieving a 6.15% improvement in accuracy over the second-best model on the USM-RCC dataset.
Hyunjun Cho, Dongjin Shin, Kwang-Hyun Uhm, Sung-Jea Ko, Yosep Chong, Seung-Won Jung
IEEE J. Biomed. Health Informatics2
2024 ViT-slice: End-to-end Vision Transformer Accelerator with Bit-slice Algorithm
abstract
Vision Transformers have demonstrated remarkable performance in various vision tasks. However, general-purpose processors, such as CPUs and GPUs, face challenges in efficiently handling the inference of Vision Transformers. To address the issue, prior works have focused on accelerating only attention due to its high computational cost in NLP Transformers. In contrast, Vision Transformers demonstrate a higher computational cost due to linear modules such as linear transformation, linear projection and Feed-Forward Network (FFN), compared to attention. In this paper, we present ViT-slice, an algorithm-architecture co-design that enhances end-to-end performance and energy efficiency by optimizing not only attention but also linear modules. At the algorithm level, we propose bit-slice compression that avoids storing the redundant most significant bits (MSBs). Additionally, we present bit-slice dot product with early skip to efficiently compute the dot product using bit-sliced data. To enable early skip during the dot product computation, we leverage a trainable threshold. On the hardware level, we introduce a specialized bit-slice dot product unit (BSDPU) to efficiently process the bit-slice dot product with early skip algorithm. Additionally, we present a bit-slice encoder and decoder for on-chip bit-slice compression. ViT-slice achieves 244×, 35.3×, 16.8×, 10.4×, 5.0× end-to-end speedup over Xeon CPU, EdgeGPU, TITAN Xp GPU, Sanger accelerator and ViTCoD accelerator, respectively.
Dongjin Shin, Insu Choi, Joon-Sung Yang
DAC1
2019 JANUS: Fast and Flexible Deep Learning via Symbolic Graph Execution of Imperative Programs
Eunji Jeong, Sungwoo Cho, Gyeong-In Yu, Joo Seong Jeong, Dongjin Shin, Byung-Gon Chun
NSDI5
2018 AndroClass: An Effective Method to Classify Android Applications by Applying Deep Neural Networks to Comprehensive Features
abstract
Android application (app) stores contain ahugenumber of apps, which aremanuallyclassified based on the apps’ descriptions into various categories. However, the predefined categories or apps descriptions are usuallynotvery accurate to reflect the real functionalities of apps, thereby leading tomisclassifythe apps, which may cause serioussecurity issuesandunreliabilityproblem in the app store. Therefore, the automatic app classification is animportantdemand to construct asecure,reliable,integrated, andeasy to navigateapp store. In this paper, we propose an effective method calledAndroClasstoautomaticallyclassify apps based on theirrealfunctionalities by usingrichandcomprehensivefeatures representing theactualfunctionalities of the apps. AndroClass performsthreesteps offeature extraction,feature refinement, andclassification. In the feature extraction step, we extract 14 various features for each app by utilizing aunified tool suite. In the feature refinement step, we applyRandom Forestalgorithm to refine the features. In the classification step, we combine refined features into asingleone and AndroClass is equipped with K‐Nearest Neighbor, Naive Bayes, Support Vector Machine, and Deep Neural Network to classify apps. On the contrary to the existing methods, all the utilized features in AndroClass arestableandclearlyrepresent the actual functionalities of the app, AndroClass doesnotpose any issues to theuser privacy, and our method can be applied to classifyunreleasedornewly releasedapps. The results ofextensiveexperiments with tworeal-worlddatasets and a dataset constructed byhuman expertsdemonstrate the effectiveness of AndroClass where the classification accuracy of AndroClass with the latter dataset is 83.5%.
Masoud Reyhani Hamedani, Dongjin Shin, Myeonggeon Lee, Seong-je Cho, Changha Hwang
Wirel. Commun. Mob. Comput.2