Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Program
-
Employer
- Nanyang Technological University
- Nature Careers
- NIST
- Cornell University
- University of Lund
- ; The University of Manchester
- Cedars Sinai Medical Center
- Chalmers University of Technology
- Monash University
- NEW YORK UNIVERSITY ABU DHABI
- Technical University of Munich
- University of Oslo
- ;
- Embry-Riddle Aeronautical University
- European Space Agency
- Harvard University
- Oak Ridge National Laboratory
- Purdue University
- RWTH Aachen University
- Technische Universität Braunschweig
- The Hebrew University of Jerusalem
- The Ohio State University
- The University of Arizona
- UNIVERSITY OF SOUTHAMPTON
- University of Sheffield
- University of South Carolina
- XIAN JIAOTONG LIVERPOOL UNIVERSITY (XJTLU)
- 17 more »
- « less
-
Field
-
mesh complexity. Most greedy algorithms utilize local operators [2, 1], or variational approaches [5] or different stages (topology, then geometry) [6], or a larger repertoire of operators [9]. More
-
; proficiency in graph data structures and algorithms for geometric analysis; advanced knowledge of surface representation math; experience in writing geometry translators for complex surface features; excellent
-
on stochastic Riemannian optimization algorithms, these methods still suffer from limitations in computational complexity. The post-doctoral fellow will build upon this preliminary work to investigate
-
months Job Requirements: Master’s degree in Mathematics, Physics, Computer Science, or Engineering Advanced knowledge of one or more of the following areas: analysis, differential geometry, optimization
-
revisit discretization methodologies in view of modern requirements and computational capabilities. The candidate will focus on developing mesh generation algorithms meeting the following criteria
-
: The successful applicant will be responsible for: Obtaining rigorous mathematical results at the interface of optimization, geometry, and data science Designing, implementing, and testing algorithms Engaging in
-
and approximately 20 doctoral candidates. Research in computer vision began in the mid-1980s and currently encompasses (i) Geometry and computer vision (including analysis of video, audio, radio, and
-
major challenge with dynamic structured data is finding representations that can effectively handle their underlying geometry, which is often defined by application-specific pseudo-distances. A common
-
Shai Evra Graph theory, representation theory, number theory Yoel Groman Symplectic Geometry Adi Glucksam Complex analysis, Potential theory, and Dynamics Or Hershkovits Geometric Analysis
-
of Mathematics at Cornell. Members of the lab engage in interdisciplinary research, drawing on approaches from geometry, topology, graphs and networks, probability/statistics, and algorithm design, in conversation