default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKwanghun Chung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j5]Sukmun Oh, Kwanghun Chung, Jiwoong Choi
:
Resource-Oriented Augmentation of a Train Timetable. IEEE Access 11: 114283-114290 (2023)- 2022
- [c8]Dylan Pollack, Lars A. Gjesteby, Michael Snyder, David Chavez, Lee Kamentsky, Kwanghun Chung, Laura J. Brattain:
Axon Tracing and Centerline Detection using Topologically-Aware 3D U-Nets. EMBC 2022: 238-242 - [c7]Benjamin Fenelon, Lars A. Gjesteby, Webster Guan, Juhyuk Park, Kwanghun Chung, Laura J. Brattain:
A Scalable Inference Pipeline for 3D Axon Tracing Algorithms. HPEC 2022: 1-6 - 2020
- [c6]Tzofi Klinghoffer, Peter Morales, Young-Gyun Park, Nicholas Evans, Kwanghun Chung, Laura J. Brattain:
Self-Supervised Feature Extraction for 3D Axon Segmentation. CVPR Workshops 2020: 4213-4219 - [c5]Adam Michaleas, Lars Gjesteby, Michael P. Snyder, David Chavez, Meagan Ash, Matthew A. Melton, Damon G. Lamb, Sara N. Burke, Kevin J. Otto, Lee Kamentsky, Webster Guan, Kwanghun Chung, Laura J. Brattain:
Active Learning Pipeline for Brain Mapping in a High Performance Computing Environment. HPEC 2020: 1-6 - [i2]Tzofi Klinghoffer, Peter Morales, Young-Gyun Park, Nicholas Evans, Kwanghun Chung, Laura J. Brattain:
Self-Supervised Feature Extraction for 3D Axon Segmentation. CoRR abs/2004.09629 (2020)
2010 – 2019
- 2018
- [c4]Mark Hernandez, Adam Brewster, Larry Thul, Brian A. Telfer, Arjun Majumdar, Heejin Choi, Taeyun Ku, Kwanghun Chung, Laura J. Brattain:
Learning-based long-range axon tracing in dense scenes. ISBI 2018: 1578-1582 - 2017
- [c3]Laura J. Brattain, Mihnea Bulugioiu, Adam Brewster, Mark Hernandez, Heejin Choi, Taeyun Ku, Kwanghun Chung, Vijay Gadepally:
A cloud-based brain connectivity analysis tool. HPEC 2017: 1-6 - [c2]Laura J. Brattain, Brian A. Telfer, Siddharth Samsi, Taeyun Ku, Heejin Choi, Kwanghun Chung:
Automated dense neuronal fiber tracing and connectivity mapping at cellular level. ISBI 2017: 332-336 - 2016
- [j4]Byung-Cheon Choi, Kwanghun Chung:
Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty. Eur. J. Oper. Res. 252(2): 367-375 (2016) - 2014
- [j3]Kwanghun Chung, Daiki Min:
Staffing a service system with appointment-based customer arrivals. J. Oper. Res. Soc. 65(10): 1533-1543 (2014) - [j2]Kwanghun Chung, Jean-Philippe P. Richard, Mohit Tawarmalani:
Lifted inequalities for $$0\mathord {-}1$$ mixed-integer bilinear covering sets. Math. Program. 145(1-2): 403-450 (2014) - 2013
- [c1]Randal C. Burns, Kunal Lillaney, Daniel R. Berger, Logan Grosenick, Karl Deisseroth, R. Clay Reid, William R. Gray Roncal, Priya Manavalan, Davi Bock, Narayanan Kasthuri, Michael M. Kazhdan, Stephen J. Smith, Dean Kleissas, Eric A. Perlman, Kwanghun Chung, Nicholas C. Weiler, Jeff Lichtman, Alexander S. Szalay, Joshua T. Vogelstein, R. Jacob Vogelstein:
The open connectome project data cluster: scalable analysis and vision for high-throughput neuroscience. SSDBM 2013: 27:1-27:11 - [i1]Randal C. Burns, William R. Gray Roncal, Dean Kleissas, Kunal Lillaney, Priya Manavalan, Eric A. Perlman, Daniel R. Berger, Davi Bock, Kwanghun Chung, Logan Grosenick, Narayanan Kasthuri, Nicholas C. Weiler, Karl Deisseroth, Michael M. Kazhdan, Jeff Lichtman, R. Clay Reid, Stephen J. Smith, Alexander S. Szalay, Joshua T. Vogelstein, R. Jacob Vogelstein:
The Open Connectome Project Data Cluster: Scalable Analysis and Vision for High-Throughput Neuroscience. CoRR abs/1306.3543 (2013) - 2010
- [j1]Mohit Tawarmalani, Jean-Philippe P. Richard, Kwanghun Chung:
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets. Math. Program. 124(1-2): 481-512 (2010)
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-07 21:18 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:
