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

Seungwu Han

dblp:91/3659 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Security and privacy · 1

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%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

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

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.912025
FlashTP: Fused, Sparsity-Aware Tensor Product for Machine Learning Interatomic Potentials · ICML 2025
Computational science and engineering › model simulation › atomistic simulation
machine learning interatomic potential
0.312025
FlashTP: Fused, Sparsity-Aware Tensor Product for Machine Learning Interatomic Potentials · ICML 2025
Computational science and engineering › computational chemistry › molecular simulation
molecular dynamics
0.312025
FlashTP: Fused, Sparsity-Aware Tensor Product for Machine Learning Interatomic Potentials · ICML 2025

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

sparse computation · 1.7kernel fusion · 1.7
YearPublicationVenuePosition
2025 FlashTP: Fused, Sparsity-Aware Tensor Product for Machine Learning Interatomic Potentials
abstract
Machine Learning Interatomic Potentials (MLIPs) enable efficient molecular dynamics (MD) simulations with high accuracy. While equivariant MLIPs achieve state-of-the-art accuracy, they face significant computational bottlenecks centered around their Tensor-Product layer, which account for up to 75% of training time and cause substantial memory overhead. We present FlashTP, a highly optimized tensor-product library that addresses these inefficiencies through kernel fusion, sparse computation, and path-aggregated execution. FlashTP achieves up to 41.6$\times$ and 60.8$\times$ kernel speedups over e3nn and NVIDIA cuEquivariance, respectively. For SevenNet-l3i5, it delivers 4.2$\times$ and 3.5$\times$ speedup while reducing peak memory usage by 6.3$\times$ and 6.2$\times$ for inference and training, respectively. The code is available at https://github.com/SNU-ARC/flashTP.
Seung Yul Lee, Hojoon Kim, Yutack Park, Seungwu Han, Yeonhong Park, Jae W. Lee
ICML5
2009 Reversible Information Hiding Considering Hierarchical Access Control
abstract
This paper proposes a reversible information hiding for supporting hierarchical control of access to embedded data. The proposed method firstly hides the most important information to an image by the reversible manner in which information is enciphered. To a stego image to which once information is hidden, this method embeds different information that is enciphered with a different key. In the proposed method, only one key corresponding to the most important data is managed, and other keys are generated from the managed key through a one-way hash function. The privileged user receives the managed key and he/she extracts and deciphers all hidden data, whereas the unprivileged user receives a key that for the least important data. The proposed method also has tamper detection ability. Simulation results show the effectiveness of the proposed method.
Masaaki Fujiyoshi, Seungwu Han, Hitoshi Kiya
IAS2