Concept

Espace localement connexe

Publications associées (64)

Temporal Conditional Coding for Dynamic Point Cloud Geometry Compression

Point clouds allow for the representation of 3D multimedia content as a set of disconnected points in space. Their inher- ent irregular geometric nature poses a challenge to efficient compression, a critical operation for both storage and trans- mission. T ...

2024

Relative plus constructions

Jérôme Scherer

Let h be a connective homology theory. We construct a functorial relative plus construction as a Bousfield localization functor in the category of maps of spaces. It allows us to associate to a pair (X,H), consisting of a connected space X and an hperfect ...

2023

Collapse-invariant properties of spaces equipped with signals or directions

Stefania Ebli

Collapsing cell complexes was first introduced in the 1930's as a way to deform a space into a topological-equivalent subspace with a sequence of elementary moves. Recently, discrete Morse theory techniques provided an efficient way to construct deformatio ...

EPFL2022

A Distributed Luenberger Observer for Linear State Feedback Systems With Quantized and Rate-Limited Communications

Colin Neil Jones, Ye Pu, Andrea Alessandretti, Francisco Fernandes Castro Rego

This article addresses the problem of simultaneous distributed state estimation, and control of linear systems with linear state feedback, subjected to process, and measurement noise, under the constraints of quantized, and rate-limited network data transm ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Voss surfaces: A design space for geodesic gridshells

Corentin Jean Dominique Fivet, Nicolas Robin Montagne, Olivier Baverel

The design of envelopes with complex geometries often leads to construction challenges. To overcome these difficulties, resorting to discrete differential geometry proved successful by establishing close links between mesh properties and the existence of g ...

2021

On The Singular Set In The Thin Obstacle Problem: Higher-Order Blow-Ups And The Very Thin Obstacle Problem

Xavier Fernandez-Real Girona

We consider the singular set in the thin obstacle problem with weight vertical bar x(n +1)vertical bar(a) for a epsilon (-1, 1), which arises as the local extension of the obstacle problem for the fractional Laplacian (a nonlocal problem). We develop a ref ...

MATHEMATICAL SCIENCE PUBL2021

, ,

2020

Robust Fano resonance in a topological mechanical beam

Romain Christophe Rémy Fleury, Wei Wang

The advances in topological condensed matter physics enable the manipulation of classic waves in different ways, such as unidirectional propagation featuring the suppression of backscattering and the robustness against impurities and disorder, making it po ...

2020

In this thesis, we developed a research direction that combines the theoretical concepts of complex networks with practical needs and applications in the field of transportation engineering. As a first objective we analyzed the phenomenon of congestion pr ...

EPFL2020

Qualitative properties and global bifurcation of solutions for a singular boundary value problem

Charles Stuart

This paper deals with a singular, nonlinear Sturm-Liouville problem of the form {A(x)u'(x)}'+ lambda u (x) = f (x, u(x), u'(x)) on (0,1) where A is positive on (0,1] but decays quadratically to zero as x approaches zero. This is the lowest level of degener ...

UNIV SZEGED, BOLYAI INSTITUTE2020

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