default search action
Taehan Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Munhyung Lee, Taehan Lee
, Junwon Yeo
Enhancing On-Device DNN Inference Performance With a Reduced Retention-Time MRAM-Based Memory Architecture. IEEE Access 12: 171295-171303 (2024) - [j13]Taehan Lee, Woosang Shin, Jong-Hyeon Lee, Sangmoon Lee, Han-Gyeol Yeom, Jong Pil Yun:
Resolving the non-uniformity in the feature space of age estimation: A deep learning model based on feature clusters of panoramic images. Comput. Medical Imaging Graph. 112: 102329 (2024) - 2023
- [c1]Woosang Shin, Jonghyeon Lee, Taehan Lee, Sangmoon Lee, Jong Pil Yun:
Anomaly Detection using Score-based Perturbation Resilience. ICCV 2023: 23315-23325
2010 – 2019
- 2016
- [j12]Taehan Lee, Yanshuang Zhang, Byung Ho Jeong:
A multi-period output DEA model with consistent time lag effects. Comput. Ind. Eng. 93: 267-274 (2016) - 2014
- [j11]Taehan Lee, Changhyun Kwon
A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty. 4OR 12(4): 373-378 (2014) - 2013
- [j10]Jang Hyun Baek, Taehan Lee, Che Soong Kim:
Performance Analysis of 2-Location Distance-Based Registration in Mobile Communication Networks. IEICE Trans. Commun. 96-B(3): 914-917 (2013) - 2012
- [j9]Jang Hyun Baek, Taehan Lee, Che Soong Kim:
Exact Modeling and Performance Analysis of Distance-Based Registration Considering the Implicit Registration Effect of Outgoing Calls. IEICE Trans. Commun. 95-B(9): 3019-3023 (2012) - 2011
- [j8]Taehan Lee, Kyungchul Park, Jang Hyun Baek:
Comparison of routing methods in optical multicast WDM ring networks. Photonic Netw. Commun. 22(1): 46-50 (2011) - 2010
- [j7]Jang Hyun Baek, Jong Hun Park, Douglas C. Sicker
Modeling and Performance Analysis of the Movement-Based Registration with Implicit Registration. IEICE Trans. Commun. 93-B(5): 1306-1309 (2010) - [j6]Yang-Ja Jang, Taehan Lee, Seungkil Lim:
Component-Based Software Development Framework for 3rd Party Logistics Business. Intell. Inf. Manag. 2(4): 278-285 (2010)
2000 – 2009
- 2007
- [j5]Taehan Lee, Kyungchul Park, Jaekyung Yang, Sungsoo Park:
Optimal Multicast Routing and Wavelength Assignment on WDM Ring Networks Without Wavelength Conversion. IEEE Commun. Lett. 11(11): 898-900 (2007) - 2006
- [j4]Taehan Lee, Sungsoo Park:
Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks. Ann. Oper. Res. 146(1): 75-89 (2006) - 2001
- [j3]Nasser S. Fard, Taehan Lee:
Spanning tree approach in all-terminal network reliability expansion. Comput. Commun. 24(13): 1348-1353 (2001) - [j2]Taehan Lee, Sungsoo Park:
An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links. Eur. J. Oper. Res. 135(1): 57-66 (2001) - 2000
- [j1]Taehan Lee, Kyungsik Lee, Sungsoo Park:
Optimal routing and wavelength assignment in WDM ring networks. IEEE J. Sel. Areas Commun. 18(10): 2146-2154 (2000)
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-12-02 21:25 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: