Concept

Espace projectif

Publications associées (59)

Graph-based image representation learning

Though deep learning (DL) algorithms are very powerful for image processing tasks, they generally require a lot of data to reach their full potential. Furthermore, there is no straightforward way to impose various properties, given by the prior knowledge a ...

EPFL2019

Simple and projective correspondence functors

Jacques Thévenaz, Serge Bouc

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. We determine exactly which simple correspondence functors are projective. We also determine which simple ...

2019

Flexible support and enhanced groove geometries for gas lubricated bearings

Philipp Kaspar Bättig

Gas lubricated Herringbone-Grooved Journal Bearings (HGJB) are a promising solution to support high-speed rotors in oil-free turbo-machinery due to their compactness, relatively low losses, no need for lubrication and low wear. Gas lubricated bearings, how ...

EPFL2019

Correspondence functors and lattices

Jacques Thévenaz, Serge Bouc

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. A main tool for this study is the construction of a correspondence functor associated to any finite latt ...

2019

Data-Driven Model for the Dynamic Characteristics of O-Rings for Gas Bearing Supported Rotors

Jürg Alexander Schiffmann, Philipp Kaspar Bättig

The measurement results of various nitrile butadiene rubber (NBR) O-Ring sizes are pre-sented, and reduced-order models are developed in order to predict the stiffness and damping coefficient as a function of O-Ring geometry, Shore hardness, squeeze, and e ...

2019

Injective And Projective Model Structures On Enriched Diagram Categories

Lyne Moser

In the enriched setting, the notions of injective and projective model structures on a category of enriched diagrams also make sense. In this paper, we prove the existence of these model structures on enriched diagram categories under local presentability, ...

2019

Fourier dimensionality reduction for fast radio transients

Jean-Philippe Thiran, Yves Wiaux, Vijay Kartik, Ming Jiang

In the context of next-generation radio interferometers, we are facing a big challenge of how to economically process data. The classical dimensionality reduction technique, averaging visibilities on time, may dilute fast radio transients (FRT). We propose ...

2019

Finding a Needle in the Haystack of Hardened Interconnect Patterns

Paolo Ienne, Grace Zgheib, Stefan Nikolic

Circuits naturally exhibit recurring patterns of local interconnect. Hardening those patterns when designing Field Programmable Gate Array (FPGA) clusters can both eliminate slow programmable connections from the critical path and remove the need for trans ...

IEEE2019

Stable high-order randomized cubature formulae in arbitrary dimension

Fabio Nobile, Giovanni Migliorati

We propose and analyse randomized cubature formulae for the numerical integration of functions with respect to a given probability measure μ defined on a domain Γ⊆ℝ^d, in any dimension d. Each cubature formula is conceived to be exact on a given finite dim ...

2018

Extension complexity of stable set polytopes of bipartite graphs

Yuri Faenza, Manuel Francesco Aprile

The extension complexity xc(P) of a polytope P is the minimum number of facets of a polytope that affinely projects to P. Let G be a bipartite graph with n vertices, m edges, and no isolated vertices. Let STAB(G) be the convex hull of the stable sets of G. ...

Springer2017

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