Related publications (32)

Unlabeled Principal Component Analysis and Matrix Completion

Yunzhen Yao, Liangzu Peng

We introduce robust principal component analysis from a data matrix in which the entries of its columns have been corrupted by permutations, termed Unlabeled Principal Component Analysis (UPCA). Using algebraic geometry, we establish that UPCA is a well-de ...
Microtome Publ2024

Novel multi-crack damage approach for pultruded fiber-polymer web-flange junctions

Thomas Keller

This paper aims to propose a novel approach to assess the multi-crack behavior of layered fiber-polymer composites. The Compliance and R-curves generated from this novel approach were useful to understand the multiple delamination process, enabling to eval ...
London2023

Algebraic twists of GL(2) automorphic forms

Vignesh Arumugam Nadarajan

In this thesis we consider the problem of estimating the correlation of Hecke eigenvalues of GL2 automorphic forms with a class of functions of algebraic origin defined over finite fields called trace functions. The class of trace functions is vast and inc ...
EPFL2023

New SIDH Countermeasures for a More Efficient Key Exchange

Tako Boris Fouotsa, Andrea Basso

The Supersingular Isogeny Diffie-Hellman (SIDH) protocol has been the main and most efficient isogeny-based encryption protocol, until a series of breakthroughs led to a polynomial-time key-recovery attack. While some countermeasures have been proposed, th ...
Springer2023

Short homology bases for hyperelliptic hyperbolic surfaces

Given a hyperelliptic hyperbolic surface S of genus g >= 2, we find bounds on the lengths of homologically independent loops on S. As a consequence, we show that for any lambda is an element of (0, 1) there exists a constant N(lambda) such that every such ...
Jerusalem2023

Efficient and Accurate Handling of Periodic Flows in Time-Sensitive Networks

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

Total Flow Analysis (TFA) is a method for the worst-case analysis of time-sensitive networks. It uses service curve characterizations of the network nodes and arrival curves of flows at their sources; for tractability, the latter are often taken to be line ...
2023

Optimizing Data Processing for Nanodiamond Based Relaxometry

Mayeul Sylvain Chipaux

The nitrogen-vacancy (NV) center in diamond is a powerful and versatile quantum sensor for diverse quantities. In particular, relaxometry (or T1), can be used to detect magnetic noise at the nanoscale. For experiments with single NV centers the analysis of ...
WILEY2023

A Hopf algebra model for Dwyer's tame spaces

Haoqing Wu

In this thesis, we give a modern treatment of Dwyer's tame homotopy theory using the language of \infty-categories.We introduce the notion of tame spectra and show it has a concrete algebraic description.We then carry out a study of \infty-operads and ...
EPFL2022

A Least-Squares Method for the Solution of the Non-smooth Prescribed Jacobian Equation

Alexandre Caboussat, Dimitrios Gourzoulidis

We consider a least-squares/relaxation finite element method for the numerical solution of the prescribed Jacobian equation. We look for its solution via a least-squares approach. We introduce a relaxation algorithm that decouples this least-squares proble ...
SPRINGER/PLENUM PUBLISHERS2022

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.