Articles avec mandats d'accès public - Chee YapEn savoir plus
Disponibles quelque part : 25
SIAN: software for structural identifiability analysis of ODE models
H Hong, A Ovchinnikov, G Pogudin, C Yap
Bioinformatics 35 (16), 2873-2874, 2019
Exigences : US National Science Foundation, US Department of Defense
Global identifiability of differential models
H Hong, A Ovchinnikov, G Pogudin, C Yap
Communications on Pure and Applied Mathematics 73 (9), 1831-1879, 2020
Exigences : US National Science Foundation, Austrian Science Fund
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
R Becker, M Sagraloff, V Sharma, C Yap
Journal of Symbolic Computation 86, 51-96, 2018
Exigences : US National Science Foundation, German Research Foundation
Complexity analysis of root clustering for a complex polynomial
R Becker, M Sagraloff, V Sharma, J Xu, C Yap
Proceedings of the 2016 ACM International Symposium on Symbolic and …, 2016
Exigences : US National Science Foundation, National Natural Science Foundation of China
Implementation of a near-optimal complex root clustering algorithm
R Imbach, VY Pan, C Yap
International Congress on Mathematical Software, 235-244, 2018
Exigences : US National Science Foundation, European Commission
Planar minimization diagrams via subdivision with applications to anisotropic Voronoi diagrams
H Bennett, E Papadopoulou, C Yap
Computer Graphics Forum 35 (5), 229-247, 2016
Exigences : US National Science Foundation, Fonds national suisse
Effective subdivision algorithm for isolating zeros of real systems of equations, with complexity analysis
J Xu, C Yap
Proceedings of the 2019 international symposium on symbolic and algebraic …, 2019
Exigences : US National Science Foundation, Chinese Academy of Sciences, National …
An approach for certifying homotopy continuation paths: Univariate case
J Xu, M Burr, C Yap
Proceedings of the 2018 ACM International Symposium on Symbolic and …, 2018
Exigences : US National Science Foundation
Amortized analysis of smooth quadtrees in all dimensions
H Bennett, C Yap
Computational Geometry 63, 20-39, 2017
Exigences : US National Science Foundation
Resolution-exact algorithms for link robots
Z Luo, YJ Chiang, JM Lien, C Yap
Algorithmic Foundations of Robotics XI: Selected Contributions of the …, 2015
Exigences : US Department of Energy
Soft subdivision motion planning for complex planar robots
B Zhou, YJ Chiang, C Yap
Computational Geometry 92, 101683, 2021
Exigences : US National Science Foundation
An algorithmic approach to small limit cycles of nonlinear differential systems: The averaging method revisited
B Huang, C Yap
Journal of Symbolic Computation 115, 492-517, 2023
Exigences : US National Science Foundation, Chinese Academy of Sciences
SIAN: a tool for assessing structural identifiability of parametric ODEs
H Hong, A Ovchinnikov, G Pogudin, C Yap
ACM Communications in Computer Algebra 53 (2), 37-40, 2019
Exigences : US National Science Foundation, US Department of Defense
Novel range functions via taylor expansions and recursive lagrange interpolation with application to real root isolation
K Hormann, L Kania, C Yap
Proceedings of the 2021 International Symposium on Symbolic and Algebraic …, 2021
Exigences : US National Science Foundation
Resolution-exact planner for thick non-crossing 2-link robots
CK Yap, Z Luo, CH Hsu
Algorithmic Foundations of Robotics XII: Proceedings of the Twelfth Workshop …, 2020
Exigences : US National Science Foundation
Certified computation of planar Morse–Smale complexes
A Chattopadhyay, G Vegter, CK Yap
Journal of Symbolic Computation 78, 3-40, 2017
Exigences : Netherlands Organisation for Scientific Research
Clustering complex zeros of triangular systems of polynomials
R Imbach, M Pouget, C Yap
Mathematics in Computer Science 15 (2), 271-292, 2021
Exigences : US National Science Foundation, European Commission
Towards Soft Exact Computation (Invited Talk)
C Yap
Computer Algebra in Scientific Computing: 21st International Workshop, CASC …, 2019
Exigences : US National Science Foundation
An algorithmic approach to limit cycles of nonlinear differential systems: the averaging method revisited
B Huang, C Yap
Proceedings of the 2019 International Symposium on Symbolic and Algebraic …, 2019
Exigences : US National Science Foundation, Chinese Academy of Sciences
Root-finding with implicit deflation
R Imbach, VY Pan, C Yap, IS Kotsireas, V Zaderman
Computer Algebra in Scientific Computing: 21st International Workshop, CASC …, 2019
Exigences : US National Science Foundation, Conseil de recherches en sciences naturelles …
Les informations concernant la publication et le financement sont déterminées automatiquement par un programme informatique