Search
Unifying Theories for Multivariate Algorithms – UTMA
Studying the tractability of computational problems is a core challenge in theoretical computer science. A central question is when, why, and how computational problems can be solved efficiently. Towards answering this question, the theory of algorithms has offered powerful unifying results, called algorithmic meta-theorems (AMTs) that provide general mathematical conditions implying the automatic derivation of efficient algorithms.
MOBILITY AND CULTURAL CONTACT IN THE SHAPING OF SOUTHERN CALIFORNIA LANDSCAPES – MeSCAL
The California coast is a worldwide biodiversity hotspot with a long and rich history of prehistoric and colonial migration, contacts and peopling processes. However, little is still known about the r
Robust Deep Learning for Artificial Genomics and Population Genetics – RoDAPoG
Advances in sequencing technologies and active worldwide sampling strategies drastically increased the amount of genomic data. Efficiently extracting information from massive genomic data remains an o
Encoding long-term memories in a neural network – ENIGMEM
People tend to remember only relevant aspects of life events. Notably, fear experiences, are preserved over time but their spatial details are lost. Where does this contextual information go? Memory c
Glucose homeostasis impairments in Alzheimer’s Disease: uncovering the role of Tau – METABOTAU
Tau pathology has been largely involved in the pathophysiology of Alzheimer’s Disease (AD). It is present in hippocampus but also hypothalamus, structures involved in cognition but also regulation of
