default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanghun Im
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Gibaeg Kim, Sanghun Im, Heung-Seon Oh:
Hierarchy-aware Biased Bound Margin Loss Function for Hierarchical Text Classification. ACL (Findings) 2024: 7672-7682- 2023
- [c9]Sanghun Im, Gibaeg Kim, Heung-Seon Oh, Seongung Jo, Donghwan Kim:
Hierarchical Text Classification as Sub-hierarchy Sequence Generation. AAAI 2023: 12933-12941 - 2021
- [i2]Sanghun Im, Gibaeg Kim, Heung-Seon Oh, Seongung Jo, Donghwan Kim:
Hierarchy Decoder is All You Need To Text Classification. CoRR abs/2111.11104 (2021) - 2020
- [j5]Jaeuk Baek
, Jaehyeok Lee, Hongsuk Shim, Sanghun Im, Youngnam Han:
Target Tracking Initiation for Multi-Static Multi-Frequency PCL System. IEEE Trans. Veh. Technol. 69(10): 10558-10568 (2020)
2010 – 2019
- 2019
- [c8]Jaeuk Baek, Jaehyeok Lee, Youngnam Han, Hongsuk Shim, Sanghun Im:
Grid-Based Target Estimation Scheme for Passive Coherent Location System. VTC Fall 2019: 1-5 - [c7]Jaehyeok Lee, Jaeuk Baek, Youngnam Han, Hongsuk Shim, Sanghun Im:
PDOP-Based Receiver Selection Algorithm for Target Localization in PCL System. VTC Fall 2019: 1-5 - 2018
- [j4]Jeong Park, Jehyuk Jang, Sanghun Im, Heung-No Lee:
A Sub-Nyquist Radar Electronic Surveillance System. IEEE Access 6: 10080-10091 (2018) - [j3]Jehyuk Jang, Sanghun Im, Heung-No Lee:
Intentional Aliasing Method to Improve Sub-Nyquist Sampling System. IEEE Trans. Signal Process. 66(12): 3311-3326 (2018) - [j2]Sangseok Yun, Sanghun Im, Il-Min Kim, Jeongseok Ha:
On the Secrecy Rate and Optimal Power Allocation for Artificial Noise Assisted MIMOME Channels. IEEE Trans. Veh. Technol. 67(4): 3098-3113 (2018) - 2017
- [c6]Sangseok Yun, Junguk Park, Sanghun Im, Jeongseok Ha:
On the Secrecy Rate of Artificial Noise Assisted MIMOME Channels with Full-Duplex Receiver. WCNC 2017: 1-6 - 2015
- [j1]Sanghun Im, Hyoungsuk Jeon, Jinho Choi, Jeongseok Ha:
Secret Key Agreement With Large Antenna Arrays Under the Pilot Contamination Attack. IEEE Trans. Wirel. Commun. 14(12): 6579-6594 (2015) - [c5]Sanghun Im, Jinho Choi, Jeongseok Ha:
Secret Key Agreement for Massive MIMO Systems with Two-Way Training under Pilot Contamination Attack. GLOBECOM Workshops 2015: 1-6 - [i1]Sanghun Im, Hyoungsuk Jeon, Jinho Choi, Jeongseok Ha:
Secret Key Agreement with Large Antenna Arrays under the Pilot Contamination Attack. CoRR abs/1507.00095 (2015) - 2014
- [c4]Youngpyo Hong, Sanghun Im, Jeongseok Ha:
Secure Antenna Subset Modulation with Coordinate Interleaved Orthogonal Designs. ICTC 2014: 97-98 - [c3]Sangseok Yun, Jinho Baek, Sanghun Im, Jeongseok Ha:
Secure code design for near field communications. ICTC 2014: 777-779 - 2013
- [c2]Sanghun Im, Hyoungsuk Jeon, Jinho Choi, Jeongseok Ha:
Secret key agreement under an active attack in MU-TDD systems with large antenna arrays. GLOBECOM 2013: 1849-1855 - [c1]Sanghun Im, Hyoungsuk Jeon, Jinho Choi, Jeongseok Ha:
Robustness of secret key agreement protocol with massive MIMO under pilot contamination attack. ICTC 2013: 1053-1058
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-09-26 01:54 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:
