Skip to main content
March 11, 2021

Tech Talk: What does it mean to have a robust algorithm? | Cindy Orozco Bohorquez | WiDS 2021

About This Video

Cindy Orozco Bohorquez, Ph.D. Candidate in Computational and Mathematical Engineering at Stanford University studies which choice is the correct one for a classical problem in computer graphics and satellite communication called point-set registration. She focuses on the special case of recovering the rotation that aligns two data sets that belong to the d-dimensional sphere. She explores combining results from statistics, optimization, and differential geometry, to compare the solutions given by these algorithms.

In This Video
Ph.D. Candidate in Computational and Mathematical Engineering, Stanford University

I am a PhD candidate at the Institute for Computational and Mathematical Engineering (ICME) at Stanford. I hold a bachelor’s in civil engineering and mathematics from Universidad de los Andes, Colombia, and a master’s in applied mathematics from King Abdullah University of Science and Technology, Saudi Arabia. My work combines modern tools of data analysis and optimization with traditional numerical analysis results. In addition to study the theoretical behavior of optimization algorithms using “real” data, I am interested in other components that affect the day-to-day data science, such parallel computing and education of applied mathematics. This workshop is an appetizer of an introductory summer workshop in Parallel Computing that I developed and taught during the last years at ICME. The high-level approach of the workshop is inspired on my own rocky journey learning parallel computing.