Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Hyeyun Yang"'
Autor:
Sumin Lee, Qianying Ye, Hyeyun Yang, Sojung Lee, YeJi Kim, Nahyun Lee, Darwin Gonzalez-Cox, Dong-Keun Yi, Soo-Yong Kim, Sangho Choi, Taesoo Choi, Man S. Kim, Seong Su Hong, Chun Whan Choi, Yoonsung Lee, Yong Hwan Park
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-14 (2024)
Abstract Inflammation is implicated as a cause in many diseases. Most of the anti-inflammatory agents in use are synthetic and there is an unmet need for natural substance-derived anti-inflammatory agents with minimal side effects. Aiouea padiformis
Externí odkaz:
https://doaj.org/article/e7a17816dbce4f329a136f978481e423
Autor:
Hyeyun Yang, Antoine Vigneron
Publikováno v:
ACM Journal of Experimental Algorithmics. 27:1-14
The third computational geometry challenge was on a coordinated path planning problem in which a collection of square robots need to move on the integer grid, from their given starting points to their target points, and without collision between robo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::218f570dbbf2972318875f4359e05361
https://doi.org/10.1145/3531224
https://doi.org/10.1145/3531224
Autor:
Antoine Vigneron, Hyeyun Yang
Publikováno v:
Theoretical Computer Science. 866:82-95
We give approximation algorithms for matching two sets of line segments in constant dimension. We consider several versions of the problem: Hausdorff distance, bottleneck distance and largest common subset. We study these similarity measures under se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8542aa223978c74135c92f92a3ec8bff
https://doi.org/10.1016/j.tcs.2021.03.014
https://doi.org/10.1016/j.tcs.2021.03.014
Autor:
Hyeyun Yang, Antoine Vigneron
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030105631
WALCOM
WALCOM
We give approximation algorithms for matching two sets of line segments in constant dimension. We consider several versions of the problem: Hausdorff distance, bottleneck distance and largest common point set. We study these similarity measures under
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22ee473aff253ebf2f12eaaedf09aad5
https://doi.org/10.1007/978-3-030-10564-8_21
https://doi.org/10.1007/978-3-030-10564-8_21
