Követés
Dohyung Park
Dohyung Park
E-mail megerősítve itt: utexas.edu
Cím
Hivatkozott rá
Hivatkozott rá
Év
Fast algorithms for robust PCA via gradient descent
X Yi, D Park, Y Chen, C Caramanis
Advances in neural information processing systems 29, 2016
3122016
Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach
D Park, A Kyrillidis, C Carmanis, S Sanghavi
Artificial Intelligence and Statistics, 65-74, 2017
1952017
Greedy subspace clustering
D Park, C Caramanis, S Sanghavi
Advances in neural information processing systems 27, 2014
1252014
Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons
D Park, J Neeman, J Zhang, S Sanghavi, IS Dhillon
International Conference on Machine Learning, 2015
972015
Opportunistic interference mitigation achieves optimal degrees-of-freedom in wireless multi-cell uplink networks
BC Jung, D Park, WY Shin
IEEE Transactions on Communications 60 (7), 1935-1944, 2012
952012
Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
D Park, A Kyrillidis, C Caramanis, S Sanghavi
SIAM Journal on Imaging Sciences 11 (4), 2165-2204, 2018
882018
Degrees of freedom on the K-user MIMO interference channel with constant channel coefficients for downlink communications
N Lee, D Park, YD Kim
GLOBECOM 2009-2009 IEEE Global Telecommunications Conference, 1-6, 2009
522009
Finding low-rank solutions to matrix problems, efficiently and provably
D Park, A Kyrillidis, C Caramanis, S Sanghavi
arXiv preprint arXiv:1606.03168, 2016
402016
Provable compressed sensing quantum state tomography via non-convex methods
A Kyrillidis, A Kalev, D Park, S Bhojanapalli, C Caramanis, S Sanghavi
npj Quantum Information 4 (1), 36, 2018
372018
Can one achieve multiuser diversity in uplink multi-cell networks?
WY Shin, D Park, BC Jung
IEEE Transactions on Communications 60 (12), 3535-3540, 2012
332012
Provable Burer-Monteiro factorization for a class of norm-constrained matrix problems
D Park, A Kyrillidis, S Bhojanapalli, C Caramanis, S Sanghavi
arXiv preprint arXiv:1606.01316, 2016
262016
Provable non-convex projected gradient descent for a class of constrained matrix optimization problems
D Park, A Kyrillidis, S Bhojanapalli, C Caramanis, S Sanghavi
stat 1050, 4, 2016
192016
A study on the optimal degree-of-freedoms of cellular networks: Opportunistic interference mitigation
BC Jung, D Park, WY Shin
2010 Conference Record of the Forty Fourth Asilomar Conference on Signals …, 2010
122010
Performance—complexity tradeoffs of rateless codes
D Park, SY Chung
2008 IEEE international symposium on information theory, 2056-2060, 2008
122008
Joint determination of power and decoding order for successive inter-and intra-cell interference cancellation
HW Chung, SW Jeon, DH Park, SY Chung
The 9th International Conference on Advanced Communication Technology 3 …, 2007
72007
On the multiuser diversity in SIMO interfering multiple access channels: Distributed user scheduling framework
WY Shin, D Park, BC Jung
Journal of Communications and Networks 17 (3), 267-274, 2015
42015
Opportunistic interference mitigation achieves optimal degrees-of-freedom in cellular networks
BC Jung, D Park, WY Shin
IEEE Trans. on Inf. Theory, 2010
32010
Finding low-rank solutions to smooth convex problems via the Burer-Monteiro approach
D Park, A Kyrillidis, C Caramanis, S Sanghavi
2016 54th Annual Allerton Conference on Communication, Control, and …, 2016
22016
Opportunistic interference management for interfering multiple-access channels
WY Shin, D Park
The Journal of Korean Institute of Communications and Information Sciences …, 2012
22012
Efficient non-convex algorithms for large-scale learning problems
D Park
2016
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20