default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChanho Park 0002
Person information
- affiliation: POSTECH, Department of Electrical Engineering, Pohang, Korea
Other persons with the same name
- Chanho Park (aka: Chan-Ho Park) — disambiguation page
- Chanho Park 0001
![[0009-0003-6305-2334]](https://dblp.org/img/orcid-mark.12x12.png "0009-0003-6305-2334")
— University of Tokyo, Graduate School of Humanities and Sociology, Information Media Center, Japan (and 1 more) - Chanho Park 0003 — University of Sheffield, Department of Computer Science, UK
- Chanho Park 0004 — Yonsei University, School of Electrical and Electronic Engineering, Seoul, Korea
- Chanho Park 0005 — Sungkyunkwan University, Department of Smart Factory Convergence, AI Research Center, Korea
- Chanho Park 0006 — Electronics and Telecommunications Research Institute (ETRI), Content Research Division, Daejeon, Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[i6]Yubeen Jo, Geon Choi, Chanho Park, Namyoon Lee:
Hierarchical Subcode Ensemble Decoding of Polar Codes. CoRR abs/2602.08391 (2026)- 2024
- [c8]Chanho Park, Namyoon Lee:
SignSGD with Federated Defense: Harnessing Adversarial Attacks through Gradient Sign Decoding. ICML 2024: 39762-39780 - [c7]Chanho Park, H. Vincent Poor, Namyoon Lee:
SignSGD-FV: Communication-Efficient Distributed Learning Through Heterogeneous Edges. ISIT 2024: 3648-3653 - [i5]Chanho Park, Namyoon Lee:
SignSGD with Federated Defense: Harnessing Adversarial Attacks through Gradient Sign Decoding. CoRR abs/2402.01340 (2024) - [i4]Chanho Park, H. Vincent Poor, Namyoon Lee:
SignSGD with Federated Voting. CoRR abs/2403.16372 (2024) - 2023
- [c6]Chanho Park, Namyoon Lee:
S3GD-MV: Sparse-SignSGD with Majority Vote for Communication-Efficient Distributed Learning. ISIT 2023: 2266-2271 - [i3]Chanho Park, Namyoon Lee:
Sparse-SignSGD with Majority Vote for Communication-Efficient Distributed Learning. CoRR abs/2302.07475 (2023) - 2021
- [c5]Chanho Park, Seunghoon Lee, Namyoon Lee:
Bayesian AirComp with Sign-Alignment Precoding for Wireless Federated Learning. GLOBECOM 2021: 1-6 - [c4]Seunghoon Lee, Chanho Park, Namyoon Lee:
Sign Gradient Aggregation for Wireless Federated Learning Using Bussgang LMMSE Estimation. ICTC 2021: 333-336 - [c3]Seunghoon Lee, Chanho Park, Songnam Hong, Yonina C. Eldar, Namyoon Lee:
Soft-Sign Stochastic Gradient Descent Algorithm for Wireless Federated Learning. SPAWC 2021: 241-245 - [c2]Hwanjoon Cho, Chanho Park, Deokhwan Han, Robert W. Heath Jr., Namyoon Lee:
Capacity of Terahertz Line-of-Sight UCA-MIMO Channels with One-Bit Transceivers. SPAWC 2021: 381-385 - [i2]Chanho Park, Seunghoon Lee, Namyoon Lee:
Bayesian AirComp with Sign-Alignment Precoding for Wireless Federated Learning. CoRR abs/2109.06579 (2021) - 2020
- [c1]Hwanjoon Cho, Chanho Park, Namyoon Lee:
Capacity-Achieving Precoding with Low-Complexity for Terahertz LOS Massive MIMO using Uniform Planar Arrays. ICTC 2020: 535-539 - [i1]Seunghoon Lee, Chanho Park, Song-Nam Hong, Yonina C. Eldar, Namyoon Lee:
Bayesian Federated Learning over Wireless Networks. CoRR abs/2012.15486 (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 2026-04-04 00:25 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:
