default search action
Daesung Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c10]Daesung Kim, Hye Won Chung:
Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization. NeurIPS 2023 - 2022
- [i3]Daesung Kim, Hye Won Chung:
Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization. CoRR abs/2212.09396 (2022) - 2021
- [j9]Daesung Kim
, Hye Won Chung
Binary Classification With XOR Queries: Fundamental Limits and an Efficient Algorithm. IEEE Trans. Inf. Theory 67(7): 4588-4612 (2021) - 2020
- [j8]Jeonghwan Lee
Robust Hypergraph Clustering via Convex Relaxation of Truncated MLE. IEEE J. Sel. Areas Inf. Theory 1(3): 613-631 (2020) - [c9]Daesung Kim, Hye Won Chung
Crowdsourced Classification with XOR Queries: An Algorithm with Optimal Sample Complexity. ISIT 2020: 2551-2555 - [i2]Daesung Kim, Hye Won Chung:
Crowdsourced Classification with XOR Queries: Fundamental Limits and An Efficient Algorithm. CoRR abs/2001.11775 (2020) - [i1]Jeonghwan Lee, Daesung Kim, Hye Won Chung:
Hypergraph Clustering in the Weighted Stochastic Block Model via Convex Relaxation of Truncated MLE. CoRR abs/2003.10038 (2020)
2010 – 2019
- 2019
- [j7]Seokha Hwang
Energy-Efficient Symmetric BC-BCH Decoder Architecture for Mobile Storages. IEEE Trans. Circuits Syst. I Regul. Pap. 66-I(11): 4462-4475 (2019) - 2018
- [j6]Daesung Kim, Injae Yoo
Fast Low-Complexity Triple-Error-Correcting BCH Decoding Architecture. IEEE Trans. Circuits Syst. II Express Briefs 65-II(6): 764-768 (2018) - [j5]Daesung Kim, Krishna R. Narayanan
Symmetric Block-Wise Concatenated BCH Codes for NAND Flash Memories. IEEE Trans. Commun. 66(10): 4365-4380 (2018) - [j4]Daesung Kim
A Fast Successive Cancellation List Decoder for Polar Codes With an Early Stopping Criterion. IEEE Trans. Signal Process. 66(18): 4971-4979 (2018) - 2017
- [c8]Seokha Hwang
An energy-optimized (37840, 34320) symmetric BC-BCH decoder for healthy mobile storages. A-SSCC 2017: 169-172 - 2016
- [c7]Daesung Kim, Jeongseok Ha:
Serial quasi-primitive BC-BCH codes for NAND flash memories. ICC 2016: 1-6 - [c6]Daejin Kim
Information set analysis of polar codes. ICTC 2016: 813-815 - [c5]Sangha Lee
A paired-page reading scheme for NAND flash memory. ICTC 2016: 1065-1067 - 2015
- [j3]Daesung Kim, Jeongseok Ha:
Quasi-Primitive Block-Wise Concatenated BCH Codes With Collaborative Decoding for NAND Flash Memories. IEEE Trans. Commun. 63(10): 3482-3496 (2015) - [c4]Daesung Kim, Jeongseok Ha:
A low-complexity decoding algorithm for concatenated tree codes. ICTC 2015: 488-490 - 2014
- [j2]Sung-Gun Cho
Block-Wise Concatenated BCH Codes for NAND Flash Memories. IEEE Trans. Commun. 62(4): 1164-1177 (2014) - [c3]Daesung Kim, Jeongseok Ha:
Quasi-primitive block-wise concatenated BCH codes for NAND flash memories. ITW 2014: 611-615 - 2013
- [j1]Youn-Kyung Lim, Daesung Kim, Jaesung Jo, Jong-bum Woo:
Discovery-Driven Prototyping for User-Driven Creativity. IEEE Pervasive Comput. 12(3): 74-80 (2013) - [c2]Yongwon Cho, Muwook Pyeon, Daesung Kim, Sujung Moon, Illwoong Jang:
Video Image Based Hyper Live Spatial Data Construction. MUSIC 2013: 371-376 - 2012
- [c1]Daesung Kim, Jinho Choi
On the soft information extraction from hard-decision outputs in MLC NAND flash memory. GLOBECOM 2012: 3208-3213
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-04-25 05:55 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: