Publications associées (62)

Efficient and insightful descriptors for representing molecular and material space

Alexander Jan Goscinski

Data-driven approaches have been applied to reduce the cost of accurate computational studies on materials, by using only a small number of expensive reference electronic structure calculations for a representative subset of the materials space, and using ...
EPFL2024

Multi-IVE: Privacy Enhancement of Multiple Soft-Biometrics in Face Embeddings

Sébastien Marcel, Hatef Otroshi Shahreza

This study focuses on the protection of soft-biometric attributes related to the demographic information of individuals that can be extracted from compact representations of face images, called embeddings. We consider a state-ofthe-art technology for soft- ...
IEEE COMPUTER SOC2023

Fair colorful k-center clustering

Ola Nils Anders Svensson, Xinrui Jia

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius rho such that there exist balls of radius rho aro ...
SPRINGER HEIDELBERG2021

On p-adic Versions of the Manin-Mumford Conjecture

Vlad Serban

We establish p-adic versions of the Manin-Mumford conjecture, which states that an irreducible subvariety of an abelian variety with dense torsion has to be the translate of a subgroup by a torsion point. We do so in the context of certain rigid analytic s ...
OXFORD UNIV PRESS2021

The (h, k)-Server Problem on Bounded Depth Trees

Marek Elias

We study the k-server problem in the resource augmentation setting, i.e., when the performance of the online algorithm with k servers is compared to the offline optimal solution with h
ASSOC COMPUTING MACHINERY2019

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.