Concept

Espace complet

Publications associées (23)

Efficient and insightful descriptors for representing molecular and material space

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

Fairness and Explainability in Clustering Problems

Xinrui Jia

In this thesis we present and analyze approximation algorithms for three different clustering problems. The formulations of these problems are motivated by fairness and explainability considerations, two issues that have recently received attention in the ...

EPFL2023

Learning a QoE Metric from Social Media and Gaming Footage

Catalina Paz Alvarez Inostroza, Aikaterini Argyraki

Defining a universal metric for Quality of Experience (QoE) is notoriously hard due to the complex relationship between low-level performance metrics and user satisfaction. The most common metric, the Mean Opinion Score (MOS), has well-known biases and inc ...

2023

The Completion Of Covariance Kernels

Victor Panaretos, Kartik Waghmare

We consider the problem of positive-semidefinite continuation: extending a partially specified covariance kernel from a subdomain Omega of a rectangular domain I x I to a covariance kernel on the entire domain I x I. For a broad class of domains Omega call ...

INST MATHEMATICAL STATISTICS-IMS2022

Linear Lipschitz and C-1 extension operators through random projection

Federico Stra

We construct a regular random projection of a metric space onto a closed doubling subset and use it to linearly extend Lipschitz and C-1 functions. This way we prove more directly a result by Lee and Naor [5] and we generalize the C-l extension theorem by ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2021

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 HEIDELBERG2022

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

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 ρ such that there exist balls of radius ρ around ...

Springer2020

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

Structural Properties Of Dendrite Groups

Nicolas Monod

Let G be the homeomorphism group of a dendrite. We study the normal subgroups of G. For instance, there are uncountably many nonisomorphic such groups G that are simple groups. Moreover, these groups can be chosen so that any isometric G-action on any metr ...

AMER MATHEMATICAL SOC2019

Denoising ECG Signal by CSTFM Algorithm: Monitoring During Motorbike and Car Races

Guglielmo Frigo

mHealth technology, by using habitual devices, i.e., smartphones, improves prevention, diagnosis, treatment, monitoring, and management of health. Monitoring heart profile during intense sports activities allows to diagnose pathologies, not identifiable wi ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Approximating Steiner trees and forests with minimum number of Steiner points

Nachshon Cohen

Let R be a finite set of terminals in a convex metric space (M, d). We give approximation algorithms for problems of finding a minimum size set S subset of M of additional points such that the unit-disc graph G[R boolean OR S] of R boolean OR S satisfies s ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2018

Delineating policies: governing spaces with no coextensive institutions : metropolitan areas and disadvantaged communities in the United States

Thomas Charles Marie Pierre Favre-Bulle

Many policies are spatially targeted: they attempt to foster or incent policy actions in areas meeting specific criteria. The identification and delineation of the spatial reality of interest is a major challenge to spatially targeted policies. In many cas ...

EPFL2017

Multidimensional Persistence and Noise

Martina Scolamiero

In this paper, we study multidimensional persistence modules (Carlsson and Zomorodian in Discrete Comput Geom 42(1):71-93, 2009; Lesnick in Found Comput Math 15(3):613-650, 2015) via what we call tame functors and noise systems. A noise system leads to a p ...

Springer2017

ASAP: a web-based platform for the analysis and interactive visualization of single-cell RNA-seq data

Bart Deplancke, Vincent Roland Julien Gardeux, Adrian Shajkofci, Petra Catalina Schwalie

Motivation: Single-cell RNA-sequencing (scRNA-seq) allows whole transcriptome profiling of thousands of individual cells, enabling the molecular exploration of tissues at the cellular level. Such analytical capacity is of great interest to many research gr ...

Oxford University Press2017

Fast recovery and approximation of hidden Cauchy structure

Robert Gerhard Jérôme Luce

We derive an algorithm of optimal complexity which determines whether a given matrix is a Cauchy matrix, and which exactly recovers the Cauchy points defining a Cauchy matrix from the matrix entries. Moreover, we study how to approximate a given matrix by ...

Elsevier Science Inc2016

Effective a posteriori Co-Phasing of Interferometric Fringe Data

Ferréol Arnaud Marie Soulez

We have recently shown that a posteriori co-phasing of multi-spectral interferograms was possible.(1) In this contribution, we extend our approach so that it can be applied to actual data as provided by AMBER(2) or MATISSE instruments. The main advantage o ...

SPIE2016

Centrality of trees for capacitated -center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) locations (called centers) and assign each ...

Springer Heidelberg2015

Actions of amenable equivalence relations on CAT(0) fields

Martin Anderegg, Philippe Paul Antoine Henry

We present the general notion of Borel fields of metric spaces and show some properties of such fields. Then we make the study specific to the Borel fields of proper CAT(0) spaces and we show that the standard tools we need behave in a Borel way. We also i ...

Cambridge University Press2014

Principal Polynomial Analysis

Devis Tuia

This paper presents a new framework for manifold learning based on a sequence of principal polynomials that capture the possibly nonlinear nature of the data. The proposed Principal Polynomial Analysis (PPA) generalizes PCA by modeling the directions of ma ...

World Scientific Publ Co Pte Ltd2014