Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Program
-
Employer
- Nanyang Technological University
- CNRS
- Oak Ridge National Laboratory
- California Institute of Technology
- NIST
- SINGAPORE INSTITUTE OF TECHNOLOGY (SIT)
- Delft University of Technology (TU Delft)
- INESC TEC
- Monash University
- National University of Singapore
- UNIVERSITY OF HELSINKI
- University of Southern Denmark (SDU)
- AMOLF
- Argonne
- Cedars Sinai Medical Center
- China National Center for Bioinformation
- EPFL
- European Magnetism Association EMA
- Hanyang University
- Harvard University
- Heriot Watt University
- INESC COIMBRA - INSTITUTO DE ENGENHARIA DE SISTEMAS E COMPUTADORES DE COIMBRA
- INSA LYON
- Indiana University
- Indiana University Bloomington
- Institute of Geophysics Polish Academy of Sciences
- KU LEUVEN
- Karolinska Institutet (KI)
- Max Planck Institute for Intelligent Systems, Tübingen, Tübingen
- NTNU - Norwegian University of Science and Technology
- National Research Council Canada
- Pennsylvania State University
- Politecnico di Milano
- ShanghaiTech University
- Technical University Darmstadt
- Technical University of Munich
- The Hebrew University of Jerusalem
- The University of Chicago
- UiT The Arctic University of Norway
- Umeå universitet stipendiemodul
- University of Bergen
- University of Lincoln
- University of Maryland, Baltimore
- University of New South Wales
- University of Oxford
- University of Washington
- Warsaw University of Technology
- Zintellect
- 38 more »
- « less
-
Field
-
expressions for latency and offloading probabilities across edge-only, cloud-only, and edge-cloud computation offloading algorithms. Design and develop robust Python APIs for edge-only, cloud-only, and edge
-
, or Mathematics Strong programming skills in Python and R Background in algebraic geometry, computational algebra, and symbolic computation Experience with algorithm development and research Preferred
-
; structural theory of sparse graphs; graph algorithms, particularly parametrised and approximation algorithms; discrete optimisation; discrete geometry and the theory of VC dimension; descriptive complexity
-
remains a substantial gap between the theory and practical behavior of many widely used algorithms. This project, led by Dr. Zhang, aims to strengthen the theoretical foundation of relative smooth
-
international collaborators. The group's interests cover a wide range of areas including extremal and probabilistic combinatorics, combinatorial optimization, graph theory, game theory, algorithmics and geometry
-
broadly with faculty in the Luddy School of Informatics, Computing, and Engineering, Data Science, Statistics, the Institute for Scientific Computing and Applied Mathematics, and scientific units across our
-
primary appointment in Mathematics and opportunities to collaborate broadly with faculty in the Luddy School of Informatics, Computing, and Engineering, Data Science, Statistics, the Institute
-
11 Jul 2026 Job Information Organisation/Company CNRS Department Laboratoire d'Informatique de l'Ecole Polytechnique Research Field Computer science Mathematics » Algorithms Researcher Profile First
-
and prior knowledge of the sample geometry. You investigate and optimize the trade-off between accuracy and imaging speed. For real-time application, the speed and accuracy of the algorithms will be
-
related field. Candidates with a B.Sc. and at least 2 years of relevant experience in developing computer vision or machine learning algorithms will also be considered. For information on certificates and