Publications associées (54)

Gaia's brightest very metal-poor (VMP) stars Metallicity catalogue of a thousand VMP stars from Gaia's radial velocity spectrometer spectra

Nicolas Lawrence Etienne Longeard

Context. Gaia DR3 has offered the scientific community a remarkable dataset of approximately one million spectra acquired with the radial velocity spectrometer (RVS) in the calcium II triplet region, which is well suited to identify very metal-poor (VMP) s ...
Edp Sciences S A2024

Robust Outlier Rejection for 3D Registration with Variational Bayes

Mathieu Salzmann, Jiancheng Yang, Zheng Dang, Zhen Wei, Haobo Jiang

Learning-based outlier (mismatched correspondence) rejection for robust 3D registration generally formulates the outlier removal as an inlier/outlier classification problem. The core for this to be successful is to learn the discriminative inlier/outlier f ...
Los Alamitos2023

Robustness, replicability and scalability in topic modelling

Orion B Penner

Approaches for estimating the similarity between individual publications are an area of long -standing interest in the scientometrics and informetrics communities. Traditional techniques have generally relied on references and other metadata, while text mi ...
ELSEVIER2022

Robust Generalization despite Distribution Shift via Minimum Discriminating Information

Daniel Kuhn, Andreas Krause, Tobias Sutter

Training models that perform well under distribution shifts is a central challenge in machine learning. In this paper, we introduce a modeling framework where, in addition to training data, we have partial structural knowledge of the shifted test distribut ...
2021

Comparing spatio-temporal networks of intermittent avalanche events: Experiment, model, and empirical data

Relaxational processes in many complex systems often occur in the form of avalanches resulting from internal cascades from across the system scale. Here, we probe the space, time, and magnitude signatures of avalanching behavior using a network of temporal ...
2020

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.