default search action
Kwangmin Yu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Jack S. Baker, Gilchan Park, Kwangmin Yu, Ara Ghukasyan, Oktay Göktas, Santosh Kumar Radha:
Parallel hybrid quantum-classical machine learning for kernelized time-series classification. Quantum Mach. Intell. 6(1): 18 (2024) - [i5]Mohammad Atif, Pulkit Dubey, Pratik P. Aghor, Vanessa López-Marrero, Tao Zhang, Abdullah Sharfuddin, Kwangmin Yu, Fan Yang, Foluso Ladeinde, Yangang Liu, Meifeng Lin, Lingda Li:
Fourier neural operators for spatiotemporal dynamics in two-dimensional turbulence. CoRR abs/2409.14660 (2024) - 2023
- [j6]Gilchan Park, Kun Zhang, Kwangmin Yu, Vladimir E. Korepin:
Quantum multi-programming for Grover's search. Quantum Inf. Process. 22(1): 54 (2023) - 2022
- [j5]Kwangmin Yu, Prabhat Kumar, Shaohua Yuan, Aiqi Cheng, Roman Samulyak:
SPACE: 3D parallel solvers for Vlasov-Maxwell and Vlasov-Poisson equations for relativistic plasmas with atomic transformations. Comput. Phys. Commun. 277: 108396 (2022) - 2021
- [j4]Corey Melnick, Patrick Semon, Kwangmin Yu, Nicholas D'Imperio, André-Marie Tremblay, Gabriel Kotliar:
Accelerated impurity solver for DMFT and its diagrammatic extensions. Comput. Phys. Commun. 267: 108075 (2021) - [j3]Zhihua Dong, Heather M. Gray, Charles Leggett, Meifeng Lin, Vincent R. Pascuzzi, Kwangmin Yu:
Porting HEP Parameterized Calorimeter Simulation Code to GPUs. Frontiers Big Data 4: 665783 (2021) - [j2]Kun Zhang, Pooja Rao, Kwangmin Yu, Hyun-Kyung Lim, Vladimir E. Korepin:
Implementation of efficient quantum search algorithms on NISQ computers. Quantum Inf. Process. 20(7): 1-27 (2021) - [i4]Zhihua Dong, Heather M. Gray, Charles Leggett, Meifeng Lin, Vincent R. Pascuzzi, Kwangmin Yu:
Porting HEP Parameterized Calorimeter Simulation Code to GPUs. CoRR abs/2103.14737 (2021) - [i3]Haiwang Yu, Zhihua Dong, Kyle Knoepfel, Meifeng Lin, Brett Viren, Kwangmin Yu:
Evaluation of Portable Acceleration Solutions for LArTPC Simulation Using Wire-Cell Toolkit. CoRR abs/2104.08265 (2021) - 2020
- [c2]Thomas Flynn, Kwangmin Yu, Abid Malik, Nicholas D'Imperio, Shinjae Yoo:
Bounding the expected run-time of nonconvex optimization with early stopping. UAI 2020: 51-60 - [i2]Thomas Flynn, Kwangmin Yu, Abid Malik, Nicholas D'Imperio, Shinjae Yoo:
Bounding the expected run-time of nonconvex optimization with early stopping. CoRR abs/2002.08856 (2020)
2010 – 2019
- 2019
- [i1]Kwangmin Yu, Thomas Flynn, Shinjae Yoo, Nicholas D'Imperio:
Layered SGD: A Decentralized and Synchronous SGD Algorithm for Scalable Deep Neural Network Training. CoRR abs/1906.05936 (2019) - 2016
- [j1]Xingyu Wang, Roman Samulyak, Xiangmin Jiao, Kwangmin Yu:
AP-Cloud: Adaptive Particle-in-Cloud method for optimal solutions to Vlasov-Poisson equation. J. Comput. Phys. 316: 682-699 (2016) - [c1]Roman Samulyak, Hsin-Chiang Chen, Kwangmin Yu:
Second Order Upwind Lagrangian Particle Method for Euler Equations. ICCS 2016: 2433-2437
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-10-22 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint