default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanghyun Son 0003
Person information
- affiliation: University of Maryland, Department of Computer Science, College Park, MD, USA
- affiliation (former): Seoul National University, Department of Computer Science and Engineering, South Korea
Other persons with the same name
- Sanghyun Son 0001 — Pusan National University, School of Computer Science and Engineering, Busan, South Korea
- Sanghyun Son 0002 — Seoul National University, Department of ECE & ASRI, South Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Sanghyun Son, Matheus Gadelha, Yang Zhou, Zexiang Xu, Ming C. Lin, Yi Zhou:
DMesh: A Differentiable Representation for General Meshes. CoRR abs/2404.13445 (2024)- [i7]Laura Yu Zheng, Sanghyun Son, Jing Liang, Xijun Wang, Brian Clipp, Ming C. Lin:
Deep Stochastic Kinematic Models for Probabilistic Motion Forecasting in Traffic. CoRR abs/2406.01431 (2024) - 2023
- [c3]Laura Y. Zheng, Sanghyun Son
, Ming C. Lin:
Traffic-Aware Autonomous Driving with Differentiable Traffic Simulation. ICRA 2023: 3517-3523 - [c2]Peng Gao, Jing Liang, Yu Shen, Sanghyun Son, Ming C. Lin:
Visual, Spatial, Geometric-Preserved Place Recognition for Cross-View and Cross-Modal Collaborative Perception. IROS 2023: 11079-11086 - [c1]Sanghyun Son, Laura Yu Zheng, Ryan Sullivan, Yi-Ling Qiao, Ming C. Lin:
Gradient Informed Proximal Policy Optimization. NeurIPS 2023 - [i6]Jing Liang, Sanghyun Son, Ming C. Lin, Dinesh Manocha:
GeoLCR: Attention-based Geometric Loop Closure and Registration. CoRR abs/2302.13509 (2023) - [i5]Sanghyun Son, Laura Yu Zheng, Ryan Sullivan, Yi-Ling Qiao, Ming C. Lin:
Gradient Informed Proximal Policy Optimization. CoRR abs/2312.08710 (2023) - 2022
- [j4]Sanghyun Son, Yi-Ling Qiao, Jason Sewall, Ming C. Lin:
Differentiable Hybrid Traffic Simulation. ACM Trans. Graph. 41(6): 258:1-258:10 (2022) - [i4]Sanghyun Son, Jing Liang, Ming C. Lin, Dinesh Manocha:
WGICP: Differentiable Weighted GICP-Based Lidar Odometry. CoRR abs/2209.09777 (2022) - [i3]Laura Y. Zheng, Sanghyun Son, Ming C. Lin:
Traffic-Aware Autonomous Driving with Differentiable Traffic Simulation. CoRR abs/2210.03772 (2022) - [i2]Sanghyun Son, Yi-Ling Qiao, Jason Sewall, Ming C. Lin:
Differentiable Hybrid Traffic Simulation. CoRR abs/2210.08046 (2022) - 2021
- [j3]Sanghyun Son, Myung-Soo Kim, Gershon Elber:
Precise Hausdorff distance computation for freeform surfaces based on computations with osculating toroidal patches. Comput. Aided Geom. Des. 86: 101967 (2021) - 2020
- [j2]Youngjin Park, Sanghyun Son, Myung-Soo Kim, Gershon Elber:
Surface-Surface-Intersection Computation Using a Bounding Volume Hierarchy with Osculating Toroidal Patches in the Leaf Nodes. Comput. Aided Des. 127: 102866 (2020) - [j1]Sanghyun Son, Seung-Hyun Yoon, Myung-Soo Kim, Gershon Elber:
Efficient Minimum Distance Computation for Solids of Revolution. Comput. Graph. Forum 39(2): 535-544 (2020) - [i1]Justin K. Terry, Nathaniel Grammel, Sanghyun Son, Benjamin Black:
Parameter Sharing For Heterogeneous Agents in Multi-Agent Reinforcement Learning. CoRR abs/2005.13625 (2020)
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-11-15 20:35 CET 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:
