default search action
Yeonhong Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Yeonhong Park, Jake Hyun, SangLyul Cho, Bonggeun Sim, Jae W. Lee:
Any-Precision LLM: Low-Cost Deployment of Multiple, Different-Sized LLMs. ICML 2024 - [i4]Yeonhong Park, Jake Hyun, SangLyul Cho, Bonggeun Sim, Jae W. Lee:
Any-Precision LLM: Low-Cost Deployment of Multiple, Different-Sized LLMs. CoRR abs/2402.10517 (2024) - 2023
- [c8]Woohyeon Baek
, Jonghyun Bae
Liquid: Mix-and-Match Multiple Image Formats to Balance DNN Training Pipeline. APSys 2023: 50-57 - 2022
- [j1]Yeonhong Park, Sunhong Min, Jae W. Lee:
Ginex: SSD-enabled Billion-scale Graph Neural Network Training on a Single Machine via Provably Optimal In-memory Caching. Proc. VLDB Endow. 15(11): 2626-2639 (2022) - [c7]Hoon Shin, Rihae Park, Seung Yul Lee, Yeonhong Park, Hyunseung Lee
Effective zero compression on ReRAM-based sparse DNN accelerators. DAC 2022: 949-954 - [c6]Michael Jaemin Kim, Jaehyun Park
Mithril: Cooperative Row Hammer Protection on Commodity DRAM Leveraging Managed Refresh. HPCA 2022: 1156-1169 - [i3]Yeonhong Park, Sunhong Min, Jae W. Lee:
Ginex: SSD-enabled Billion-scale Graph Neural Network Training on a Single Machine via Provably Optimal In-memory Caching. CoRR abs/2208.09151 (2022) - 2021
- [c5]Young H. Oh, Seonghak Kim, Yunho Jin, Sam Son, Jonghyun Bae, Jongsung Lee
Layerweaver: Maximizing Resource Utilization of Neural Processing Units via Layer-Wise Scheduling. HPCA 2021: 584-597 - [c4]Jun Heo, Seung Yul Lee, Sunhong Min, Yeonhong Park, Sungjun Jung, Tae Jun Ham, Jae W. Lee:
BOSS: Bandwidth-Optimized Search Accelerator for Storage-Class Memory. ISCA 2021: 279-291 - [i2]Michael Jaemin Kim, Jaehyun Park, Yeonhong Park, Wanju Doh, Namhoon Kim, Tae Jun Ham, Jae W. Lee, Jung Ho Ahn:
Mithril: Cooperative Row Hammer Protection on Commodity DRAM Leveraging Managed Refresh. CoRR abs/2108.06703 (2021) - 2020
- [c3]Tae Jun Ham, Sungjun Jung, Seonghak Kim, Young H. Oh, Yeonhong Park, Yoonho Song
A3: Accelerating Attention Mechanisms in Neural Networks with Approximation. HPCA 2020: 328-341 - [c2]Yeonhong Park, Seung Yul Lee, Hoon Shin, Jun Heo, Tae Jun Ham, Jae W. Lee:
Unlocking Wordline-level Parallelism for Fast Inference on RRAM-based DNN Accelerator. ICCAD 2020: 103:1-103:9 - [c1]Yeonhong Park, Woosuk Kwon, Eojin Lee, Tae Jun Ham, Jung Ho Ahn
Graphene: Strong yet Lightweight Row Hammer Protection. MICRO 2020: 1-13 - [i1]Tae Jun Ham, Sungjun Jung, Seonghak Kim, Young H. Oh, Yeonhong Park, Yoonho Song, Jung-Hun Park, Sanghee Lee, Kyoung Park, Jae W. Lee, Deog-Kyoon Jeong:
A3: Accelerating Attention Mechanisms in Neural Networks with Approximation. CoRR abs/2002.10941 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: