Publication

Computing Crowd Consensus with Partial Agreement (Extended Abstract)

Publications associées (26)

Search for X(3872) and X(3915) decay into chi(c1)pi(0) in B decays at Belle

Olivier Schneider, Sun Hee Kim, Tagir Aushev, Mingkui Wang, Chao Wang, Donghyun Kim, Lei Li, Yiming Li, Xiao Wang

We report a search for X(3872) and X(3915) in B+ ->chi(c1)pi K-0(+) decays. We set an upper limit of B(B+ -> X(3872)K+) x B(X(3872) -> chi(c1)pi(0)) < 8.1 x 10(-6) and B(B+ -> X(3915)K+) x B(X(3915) -> chi(c1)pi(0)) < 3.8 x 10(-5) at 90% confidence level. ...

American Physical Society2019

Statistical Applications of Random Matrix Theory: Comparison of Two Populations

Rémy Mariétan

During the last twenty years, Random matrix theory (RMT) has produced numerous results that allow a better understanding of large random matrices. These advances have enabled interesting applications in the domain of communication. Although this theory can ...

EPFL2019

Low Power Sensing and Processing in Wearable Biomedical Devices for Personalized Health Monitoring

Grégoire Casimir Joseph Surrel

Whether it is for personal use or for medical application, wearable sensors are becoming more and more widespread. This is the industry answer to two parallel trends. First, the public show a wish to collect data about their own lifestyle. This rather new ...

EPFL2019

Verified Functional Programming

Nicolas Charles Yves Voirol

In this thesis, we present Stainless, a verification system for an expressive subset of the Scala language. Our system is based on a dependently-typed language and an algorithmic type checking procedure which ensures total correctness. We rely on SMT solve ...

EPFL2019

Stochastic approximation methods for PDE constrained optimal control problems with uncertain parameters

Matthieu Claude Martin

This thesis work focuses on optimal control of partial differential equations (PDEs) with uncertain parameters, treated as a random variables. In particular, we assume that the random parameters are not observable and look for a deterministic control which ...

EPFL2019

Matching fields and lattice points of simplices

Georg Peter Loho

We show that the Chow covectors of a linkage matching field define a bijection of lattice points and we demonstrate how one can recover the linkage matching field from this bijection. This resolves two open questions from Sturmfels & Zelevinsky (1993) on l ...

2020