Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Program
-
Employer
- UNIVERSITY OF SOUTHAMPTON
- McGill University
- Nature Careers
- ;
- CEA
- Cedars Sinai Medical Center
- Cranfield University
- European Space Agency
- Ghent University
- Monash University
- Nanyang Technological University
- The University of Southampton
- University of Central Florida
- University of Colorado
- University of Glasgow
- University of Lund
- University of Minnesota
- University of South-Eastern Norway
- University of Virginia
- University of Washington
- Virginia Tech
- 11 more »
- « less
-
Field
-
a very active AI community including industry-led AI research groups (Google, Meta, DeepMind, Microsoft, Samsung, ServiceNow, Borealis) as well as a thriving start-up community. The CERC nominee will
-
systems. Montreal is home to a very active AI community including industry-led AI research groups (Google, Meta, DeepMind, Microsoft, Samsung, ServiceNow, Borealis) as well as a thriving start-up community
-
, and YouTube. Familiarity with social media management tools (e.g., Sprout Social, Hootsuite, Later) and analytics platforms (e.g., Meta Insights, Google Analytics). Strong skills in short-form video
-
Computer Science, Southampton. The project is researching, developing and evaluating decentralised algorithms, meta-information data structures and indexing techniques to enable large-scale data search
-
This position is ideally suited to someone wishing to transition from a post-doctorate career in academia to commercial software and algorithm development. You are not expected to be an AI expert
-
research environment focusing on integrating multi-source data and developing novel algorithms to address the challenges posed by global environmental change. You will focus on integrating experiments, field
-
)—topics including, but not limited to: · Physics-informed neural networks (PINN) & neural operators · Physics-aware convolutional neural networks (PARC) · Meta-learning/transfer
-
hyperparameter optimization, meta-learning, and adversarial training. The general bilevel problem can be written as: min F (x, y∗(x)) where y∗(x) = arg min f (x, y), d
-
of interest include proof complexity, circuit complexity, communication complexity, meta-complexity, and their connections to algorithms. Lund University is located in the Öresund area, which is offering one
-
opportunities. Define target audiences for social channels and set guidelines for the development of highly engaging content that accounts for platform algorithms. Conceive of integrated digital storytelling