default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSangheon Lee 0006
Person information
- affiliation: Seoul National University, Department of Electrical and Computer Engineering, Seoul, South Korea
Other persons with the same name
- Sangheon Lee (aka: Sang-Heon Lee, Sang Heon Lee) — disambiguation page
- Sangheon Lee 0001
![[0000-0002-3655-7981]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-3655-7981")
(aka: Sang-Heon Lee 0001) — University of South Australia, Mawson Lakes, Australia - Sangheon Lee 0002 — Ulsan National Institute of Science and Technology, Ulsan, South Korea
- Sangheon Lee 0003 (aka: Sang-Heon Lee 0003) — Kyungpook National University, Daegu, Republic of Korea (and 1 more)
- Sangheon Lee 0004 — Yonsei University, Seoul, South Korea
- Sangheon Lee 0005 — Kwangwoon University, Seoul, South Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c7]Donghyeon Lee, Sang-Heon Lee, Ho Seong Lee, Hyuk-Jae Lee, Kyujoong Lee:
Context-Preserving Filter Reorganization for VDSR-Based Super-resolution. AICAS 2019: 107-111- 2017
- [j3]Dongwoo Lee, Sang-Heon Lee, Soojung Ryu, Kiyoung Choi:
Dirty-Block Tracking in a Direct-Mapped DRAM Cache with Self-Balancing Dispatch. ACM Trans. Archit. Code Optim. 14(2): 11:1-11:25 (2017) - 2016
- [c6]Jaehyun Kim, Kiyoung Choi, Sang-Heon Lee, Soojung Ryu:
Dynamic clock synchronization scheme between voltage domains in multi-core architecture. VLSI-SoC 2016: 1-6 - 2014
- [c5]Sang-Heon Lee, Yeon-Gon Cho, Soojung Ryu, Byeonghun Lee, Yeong-Gil Shin:
Seeded region growing on multi-core system. ICCE 2014: 490-491 - 2012
- [c4]Seunghun Jin, Sang-Heon Lee, Moo-Kyoung Chung, Yeon-Gon Cho, Soojung Ryu:
Implementation of a volume rendering on coarse-grained reconfigurable multiprocessor. FPT 2012: 243-246 - 2010
- [c3]Sang-Heon Lee, Nak-Woong Eum, Moo-Kyoung Chung, Chong-Min Kyung:
Low latency variable length coding scheme for frame memory recompression. ICME 2010: 232-237
2000 – 2009
- 2009
- [j2]Sang-Heon Lee, Moo-Kyoung Chung, Sung-Mo Park, Chong-Min Kyung:
Lossless frame memory recompression for video codec preserving random accessibility of coding unit. IEEE Trans. Consumer Electron. 55(4): 2105-2113 (2009) - 2008
- [j1]Sang-Heon Lee, Hyuk-Jae Lee:
Motion-Compensated Frame Interpolation for Intra-Mode Blocks. IEICE Trans. Inf. Syst. 91-D(4): 1117-1126 (2008) - 2007
- [c2]Sang-Heon Lee, Myungje Cho, Hyuk-Jae Lee:
An Edge-Adaptive Block Matching Algorithm for Error Concealment. ICME 2007: 128-131 - [i1]Jae-Gon Lee, Moo-Kyoung Chung, Ki-Yong Ahn, Sang-Heon Lee, Chong-Min Kyung:
A Prediction Packetizing Scheme for Reducing Channel Traffic in Transaction-Level Hardware/Software Co-Emulation. CoRR abs/0710.4701 (2007) - 2005
- [c1]Jae-Gon Lee, Moo-Kyoung Chung, Ki-Yong Ahn, Sang-Heon Lee, Chong-Min Kyung:
A Prediction Packetizing Scheme for Reducing Channel Traffic in Transaction-Level Hardware/Software Co-Emulation. DATE 2005: 384-389
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-11-28 21:28 CET 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:
