Подписаться
Geewon Suh
Geewon Suh
Подтвержден адрес электронной почты в домене kaist.ac.kr
Название
Процитировано
Процитировано
Год
Matrix sparsification for coded matrix multiplication
G Suh, K Lee, C Suh
2017 55th Annual Allerton Conference on Communication, Control, and …, 2017
442017
(1, k)‐Coloring of Graphs with Girth at Least Five on a Surface
H Choi, I Choi, J Jeong, G Suh
Journal of Graph Theory 84 (4), 521-535, 2017
18*2017
Mc2g: An efficient algorithm for matrix completion with social and item similarity graphs
Q Zhang, G Suh, C Suh, VYF Tan
IEEE Transactions on Signal Processing 70, 2681-2697, 2022
142022
Sparse Spanning -Connected Subgraphs in Tournaments
DY Kang, J Kim, Y Kim, G Suh
SIAM Journal on Discrete Mathematics 31 (3), 2206-2227, 2017
62017
Characterizing graphs of maximum matching width at most 2
J Jeong, S Ok, G Suh
Discrete Applied Mathematics 248, 102-113, 2018
52018
Recommendation Model for Battlefield Analysis based on Siamese Network
G Suh, Y Shin, S Jin, W Lee, J Ahn, C Suh
Journal of the Korea Society of Computer and Information 28 (1), 1-8, 2023
42023
When to use graph side information in matrix completion
G Suh, S Jeon, C Suh
2021 IEEE International Symposium on Information Theory (ISIT), 2113-2118, 2021
22021
Graph-assisted matrix completion in a multi-clustered graph model
G Suh, C Suh
2022 IEEE International Symposium on Information Theory (ISIT), 3156-3161, 2022
12022
Automated Course of Action Evaluation for Military Decision-Making
G Suh, H Yi, M Kim, B Kim, M Lee, J Baek, C Suh
Journal of the Korea Institute of Military Science and Technology 27 (4 …, 2024
2024
Matrix completion with two-sided information
G Suh, C Suh
International Conference on Electronics, Information, and Communication …, 2022
2022
Enforcing Constraints in RNA Secondary Structure Predictions: A Post-Processing Framework Based on the Assignment Problem
G Suh, G Hwang, S Kang, D Baek, M Kang
Forty-first International Conference on Machine Learning, 0
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–11