Concept

Précision et rappel

Publications associées (32)

Computation of sensitivity coefficients in fixed source simulations with SERPENT2

Within the scope of the implementation of a nuclear data pipeline aiming at producing the best possible evaluated nuclear data files, a major point is the production of relevant sensitivity coefficients when including integral benchmark information. Thanks ...

Lausanne2024

Deep learning approach for identification of H II regions during reionization in 21-cm observations - II. Foreground contamination

Jean-Paul Richard Kneib, Emma Elizabeth Tolley, Tianyue Chen, Michele Bianco

The upcoming Square Kilometre Array Observatory will produce images of neutral hydrogen distribution during the epoch of reionization by observing the corresponding 21-cm signal. However, the 21-cm signal will be subject to instrumental limitations such as ...

Oxford Univ Press2024

Capsizing due to friction-induced twist in the failure of stopper knots

Pedro Miguel Nunes Pereira de Almeida Reis, Paul Johanns

We investigate the failure mechanism of stopper knots, with a particular focus on the figure -8 knot as a representative example. Stopper knots are widely used in climbing, sailing, racket stringing, and sewing to maintain tension in ropes, strings, or thr ...

Elsevier2024

GANDALF: Graph-based transformer and Data Augmentation Active Learning Framework with interpretable features for multi-label chest Xray classification

Informative sample selection in an active learning (AL) setting helps a machine learning system attain optimum performance with minimum labeled samples, thus reducing annotation costs and boosting performance of computer-aided diagnosis systems in the pres ...

Amsterdam2024

High-precision optical magnetometry using Nitrogen Vacancies in CVD diamond

Hossein Babashah

Sensing weak magnetic fields is a topic of great importance in basic science and technology due to its wide range of applications. In this context, solid-state and nanoscale quantum sensors are poised to revolutionize the sensing platforms due to their ult ...

EPFL2023

Bootstrapping for Approximate Homomorphic Encryption with Negligible Failure-Probability by Using Sparse-Secret Encapsulation

Jean-Pierre Hubaux, Juan Ramón Troncoso-Pastoriza, Jean-Philippe Léonard Bossuat

Bootstrapping parameters for the approximate homomorphic-encryption scheme of Cheon et al., CKKS (Asiacrypt 17), are usually instantiated using sparse secrets to be efficient. However, using sparse secrets constrains the range of practical parameters withi ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Mixed-precision explicit stabilized Runge-Kutta methods for single- and multi-scale differential equations

Giacomo Rosilho De Souza, Matteo Croci

Mixed-precision algorithms combine low-and high-precision computations in order to benefit from the performance gains of reduced-precision without sacrificing accuracy. In this work, we design mixed-precision Runge-Kutta-Chebyshev (RKC) methods, where high ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

Precise determination of the low-energy electronuclear Hamiltonian of LiY1-xHoxF4

Sandrine Gerber, Michael Müller

The insulating rare-earth magnet LiY1-xHoxF4 has received great attention because a laboratory field applied perpendicular to its crystallographic c axis converts the low-energy electronic spin Hamiltonian into the (dilute) transverse field Ising model. Th ...

2022

Removing Algorithmic Discrimination (With Minimal Individual Error)

Rachid Guerraoui, El Mahdi El Mhamdi, Alexandre David Olivier Maurer, Le Nguyen Hoang

We address for the first time the problem of correcting group discriminations within a score function, while minimizing the individual error. Each group is described by a probability density function on the set of profiles. We first solve the problem analy ...

2022

Removing algorithmic discrimination (with minimal individual error)

Rachid Guerraoui, El Mahdi El Mhamdi, Alexandre David Olivier Maurer, Le Nguyen Hoang

ELSEVIER2022

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.

Connectez-vous pour utiliser Chat avec Graph Search