Concept

Métrique pseudo-riemannienne

Publications associées (26)

A Gapless Post-quantum Hash Proof System in the Hamming Metric

A hash proof system (HPS) is a form of implicit proof of membership to a language. Out of the very few existing post-quantum HPS, most are based on languages of ciphertexts of code-based or lattice-based cryptosystems and inherently suffer from a gap cause ...

2023

FIBERED TORIC VARIETIES

Leonid Monin

A toric variety is called fibered if it can be represented as a total space of fibre bundle over toric base and with toric fiber. Fibered toric varieties form a special case of toric variety bundles. In this note we first give an introduction to the class ...

Moscow2023

Learning to Represent and Reconstruct 3D Deformable Objects

Jan Bednarík

Representing and reconstructing 3D deformable shapes are two tightly linked problems that have long been studied within the computer vision field. Deformable shapes are truly ubiquitous in the real world, whether be it specific object classes such as human ...

EPFL2022

Geodesic flows on real forms of complex semi-simple Lie groups of rigid body type

Tudor Ratiu

The geodesic flows are studied on real forms of complex semi-simple Lie groups with respect to a left-invariant (pseudo-)Riemannian metric of rigid body type. The Williamson types of the isolated relative equilibria on generic adjoint orbits are determined ...

SPRINGER INTERNATIONAL PUBLISHING AG2020

Classical Misuse Attacks on NIST Round 2 PQC: The Power of Rank-Based Schemes

Serge Vaudenay, Loïs Evan Huguenin-Dumittan

The US National Institute of Standards and Technology (NIST) recently announced the public-key cryptosystems (PKC) that have passed to the second round of the post-quantum standardization process. Most of these PKC come in two flavours: a weak IND-CPA vers ...

Springer, Cham2020

Benchmarking of the plane-to-plane metric

Touradj Ebrahimi, Evangelos Alexiou

In this report we benchmark the plane-to-plane objective quality metric. This is, a metric that measures the angular similarity of tangent planes between two point cloud models and relies on normal vectors that are carried with associated pairs of points. ...

2020

Framework to Approximate the Value of Information of Bridge Load Testing for Reserve Capacity Assessment

Ian Smith, Numa Joy Bertola, Marco Proverbio

In developed countries, structural assessment of existing bridges should not be performed using the same conservative models that are used at the design stage. Field measurements of real behavior provide additional information for the inference of previous ...

2020

A Looping-Delooping Adjunction For Topological Spaces

Martina Rovelli

Every principal G-bundle over X is classified up to equivalence by a homotopy class X -> BG, where BG is the classifying space of G. On the other hand, for every nice topological space X Milnor constructed a strict model of its loop space (Omega) over tild ...

Int Press Boston, Inc2017

When does a volume of a bundle achieve saturation? A microstructure informed tractography study

Jean-Philippe Thiran, Gabriel Girard, David Paul Roger Romascano, Alessandro Daducci, Muhamed Barakovic, Maxime Descoteaux

Volumetric analysis of bundles derived from tractography is a popular statistical measure used in neurological disorder studies. Recent research performed by Gauvin shows that different bundles saturate with different tractography parameters, however, to a ...

2017

Bi-Jacobi Fields And Riemannian Cubics For Left-Invariant SO(3)

Tudor Ratiu

Bi-Jacobi fields are generalized Jacobi fields, and are used to efficiently compute approximations to Riemannian cubic splines in a Riemannian manifold M. Calculating bi-Jacobi fields is straightforward when M is a symmetric space such as bi-invariant SO(3 ...

Int Press Boston, Inc2016

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