default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDohyung Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j4]Dohyung Park, Anastasios Kyrillidis, Constantine Caramanis
, Sujay Sanghavi:
Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably. SIAM J. Imaging Sci. 11(4): 2165-2204 (2018)- 2017
- [c8]Dohyung Park, Anastasios Kyrillidis, Constantine Caramanis, Sujay Sanghavi:
Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach. AISTATS 2017: 65-74 - [i9]Anastasios Kyrillidis, Amir Kalev, Dohyung Park, Srinadh Bhojanapalli, Constantine Caramanis, Sujay Sanghavi:
Provable quantum state tomography via non-convex methods. CoRR abs/1711.02524 (2017) - 2016
- [c7]Dohyung Park, Anastasios Kyrillidis, Constantine Caramanis, Sujay Sanghavi:
Finding low-rank solutions to smooth convex problems via the Burer-Monteiro approach. Allerton 2016: 439-446 - [c6]Xinyang Yi, Dohyung Park, Yudong Chen, Constantine Caramanis:
Fast Algorithms for Robust PCA via Gradient Descent. NIPS 2016: 4152-4160 - [i8]Xinyang Yi, Dohyung Park, Yudong Chen, Constantine Caramanis:
Fast Algorithms for Robust PCA via Gradient Descent. CoRR abs/1605.07784 (2016) - [i7]Dohyung Park, Anastasios Kyrillidis, Srinadh Bhojanapalli, Constantine Caramanis, Sujay Sanghavi:
Provable non-convex projected gradient descent for a class of constrained matrix optimization problems. CoRR abs/1606.01316 (2016) - [i6]Dohyung Park, Anastasios Kyrillidis, Constantine Caramanis, Sujay Sanghavi:
Finding Low-rank Solutions to Matrix Problems, Efficiently and Provably. CoRR abs/1606.03168 (2016) - [i5]Dohyung Park, Anastasios Kyrillidis, Constantine Caramanis, Sujay Sanghavi:
Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach. CoRR abs/1609.03240 (2016) - 2015
- [j3]Won-Yong Shin, Dohyung Park, Bang Chul Jung:
On the multiuser diversity in SIMO interfering multiple access channels: Distributed user scheduling framework. J. Commun. Networks 17(3): 267-274 (2015) - [c5]Dohyung Park, Joe Neeman, Jin Zhang, Sujay Sanghavi, Inderjit S. Dhillon:
Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons. ICML 2015: 1907-1916 - [i4]Dohyung Park, Joe Neeman, Jin Zhang, Sujay Sanghavi, Inderjit S. Dhillon:
Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons. CoRR abs/1507.04457 (2015) - 2014
- [c4]Dohyung Park, Constantine Caramanis, Sujay Sanghavi:
Greedy Subspace Clustering. NIPS 2014: 2753-2761 - [i3]Dohyung Park, Constantine Caramanis, Sujay Sanghavi:
Greedy Subspace Clustering. CoRR abs/1410.8864 (2014) - 2012
- [j2]Bang Chul Jung, Dohyung Park, Won-Yong Shin:
Opportunistic Interference Mitigation Achieves Optimal Degrees-of-Freedom in Wireless Multi-Cell Uplink Networks. IEEE Trans. Commun. 60(7): 1935-1944 (2012) - [j1]Won-Yong Shin, Dohyung Park, Bang Chul Jung:
Can One Achieve Multiuser Diversity in Uplink Multi-Cell Networks? IEEE Trans. Commun. 60(12): 3535-3540 (2012) - [i2]Won-Yong Shin, Dohyung Park, Bang Chul Jung:
Can One Achieve Multiuser Diversity in Uplink Multi-Cell Networks? CoRR abs/1207.2137 (2012) - 2010
- [c3]Dohyung Park, Joonsung Kang, Eung Sun Kim:
Ad hoc indoor peer-to-peer tracking using relative location estimation. IPIN 2010: 1-8 - [i1]Bang Chul Jung, Dohyung Park, Won-Yong Shin:
Opportunistic Interference Mitigation Achieves Optimal Degrees-of-Freedom in Cellular Networks. CoRR abs/1006.2380 (2010)
2000 – 2009
- 2009
- [c2]Namyoon Lee, Dohyung Park, Young-Doo Kim:
Degrees of Freedom on the K-User MIMO Interference Channel with Constant Channel Coefficients for Downlink Communications. GLOBECOM 2009: 1-6 - 2008
- [c1]Dohyung Park, Sae-Young Chung:
Performance - complexity tradeoffs of rateless codes. ISIT 2008: 2056-2060
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-05-08 20: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:
