Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Field
-
) Academic Disciplines: Pure mathematics: algebraic geometry, differential geometry, partial differential equations, number theory, probability. Theory of Computing: all areas of theoretical computer
-
Assistant Professor (tenure-track) and Associate Professor (tenured) Positions in Computer Scienc...
information. The section is part of the Department of Mathematics and Computer Science, and other research sections at the department are Algorithms Computational Science Data Science and Statistics Geometry
-
Professor positions in Quantum Mathematics with emphasis on pure mathematics with relations to quantum theory or with emphasis on Quantum algorithms, Quantum software and Quantum computing. The targeted
-
polarization along with novel quantum geometries and topologies. We seek candidates with expertise in developing modern tools involving artificial intelligence, data science, and machine learning algorithms
-
in Quantum Mathematics with emphasis on pure mathematics with relations to quantum theory or with emphasis on Quantum algorithms, Quantum software and Quantum computing. The targeted starting date
-
Quantum Mathematics with emphasis on pure mathematics with relations to quantum theory or with emphasis on Quantum algorithms, Quantum software and Quantum computing. The targeted starting date
-
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
-
measurements are sensitive to the dielectric constant and object geometry. So far, we have used this technology to estimate the vegetation water content (VWC), provide information on the vegetation structure
-
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
-
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