default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoonsoo Choi
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Sekjin Hwang
, Jinwoo Choi, Joonsoo Choi:
Enhancing Active Learning With Semi-Supervised Loss Prediction Modules. IEEE Access 12: 118756-118765 (2024)- 2022
- [j4]Sekjin Hwang, Jinwoo Choi, Joonsoo Choi:
Uncertainty-Based Selective Clustering for Active Learning. IEEE Access 10: 110983-110991 (2022)
2010 – 2019
- 2016
- [j3]Jung-Heum Park, Joonsoo Choi, Hyeong-Seok Lim:
Algorithms for finding disjoint path covers in unit interval graphs. Discret. Appl. Math. 205: 132-149 (2016) - 2012
- [c12]Joonsoo Choi, Jaewee Heo, Kwang-Soo Hahn, Junho Kim:
DEM Interpolation from Contours Using Medial Axis Transformation. ICCSA (1) 2012: 214-227 - [c11]Min-Gee Hong, In-Kyu Jeong, Joonsoo Choi, Choen Kim:
Mapping of ALOS PALSAR σ0-based forest stem volume classification map. IGARSS 2012: 6523-6526
2000 – 2009
- 2006
- [c10]June-Suh Cho, Joonsoo Choi:
Partial Object Recognition based on an Ellipse using Symmetry in Image Databases. CATA 2006: 163-167 - 2005
- [c9]June-Suh Cho, Joonsoo Choi:
Contour-based partial object recognition using symmetry in image databases. SAC 2005: 1190-1194 - 2004
- [c8]Joonsoo Choi, Kwang-Soo Hahn, Heekyung Seo, Seong-Cheol Kim:
Design, Analysis, and Optimization of LCD Backlight Unit Using Ray Tracing Simulation. ICCSA (3) 2004: 837-846 - [c7]June-Suh Cho, Hongki Kim, Joonsoo Choi:
Object Classification Using Pre-assigned Intervals in Image Databases. IKE 2004: 49-55 - 2003
- [c6]Do-Young Kwak, Noh-Gyoung Kang, Jaewon Lee, Seong-Cheol Kim, Joonsoo Choi:
Characterization of spatial channel model based on ray path analysis in high-rise urban environment. PIMRC 2003: 955-959 - 2000
- [j2]Jürgen Sellen, Joonsoo Choi, Chee-Keng Yap:
Precision-Sensitive Euclidean Shortest Path in 3-Space. SIAM J. Comput. 29(5): 1577-1595 (2000)
1990 – 1999
- 1998
- [c5]Joonsoo Choi, Chan-Su Shin, Sung Kwon Kim:
Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles. ISAAC 1998: 29-38 - 1997
- [j1]Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap:
Approximate Euclidean Shortest Paths in 3-Space. Int. J. Comput. Geom. Appl. 7(4): 271-295 (1997) - 1996
- [c4]Joonsoo Choi, Chee-Keng Yap:
Monotonicity of Rectilinear Geodesics in d-Space (Extended Abstract). SCG 1996: 339-348 - 1995
- [b1]Joonsoo Choi:
Geodesic Problems in High Dimensions. New York University, USA, 1995 - [c3]Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap:
Precision-Sensitive Euclidean Shortest Path in 3-Space (Extended Abstract). SCG 1995: 350-359 - [c2]Joonsoo Choi, Chee-Keng Yap:
Rectilinear Geodesics in 3-Space (Extended Abstract). SCG 1995: 380-389 - 1994
- [c1]Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap:
Approximate Euclidean Shortest Path in 3-Space. SCG 1994: 41-48
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-09-22 00:32 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:
