Concept

Carré

Publications associées (37)

Metrizing Fairness

Daniel Kuhn, Yves Rychener, Bahar Taskesen

We study supervised learning problems for predicting properties of individuals who belong to one of two demographic groups, and we seek predictors that are fair according to statistical parity. This means that the distributions of the predictions within th ...

2022

Unlocking crowding by ensemble statistics

Michael Herzog, David Pascucci, Oh-Hyeon Choung, Yury Markov, Natalia Tiurina

In crowding,1-7 objects that can be easily recognized in isolation appear jumbled when surrounded by other elements.8 Traditionally, crowding is explained by local pooling mechanisms,3,6,9-15 but many findings have shown that the global configuration of th ...

CELL PRESS2022

HybridSDF: Combining Deep Implicit Shapes and Geometric Primitives for 3D Shape Representation and Manipulation

Pascal Fua, Nicolas Talabot, Subeesh Vasu, Artem Lukoianov

Deep implicit surfaces excel at modeling generic shapes but do not always capture the regularities present in manufactured objects, which is something simple geometric primitives are particularly good at. In this paper, we propose a representation combinin ...

2022

Extremal Eigenvalues Of The Dirichlet Biharmonic Operator On Rectangles

We study the behaviour of extremal eigenvalues of the Dirichlet biharmonic operator over rectangles with a given fixed area. We begin by proving that the principal eigenvalue is minimal for a rectangle for which the ratio between the longest and the shorte ...

2020

The uniform symbolic topology property for diagonally F-regular algebras

Javier Alonso Carvajal Rojas

Let k be a field of positive characteristic. Building on the work of the second named author, we define a new class of k-algebras, called diagonally F-regular algebras, for which the so-called Uniform. Symbolic Topology Property (USTP) holds effectively. W ...

2020

On the Volume of the John-Lowner Ellipsoid

Grigory Ivanov

We find an optimal upper bound on the volume of the John ellipsoid of a k-dimensional section of the n-dimensional cube, and an optimal lower bound on the volume of the Lowner ellipsoid of a projection of the n-dimensional cross-polytope onto a k-dimension ...

SPRINGER2020

3D Smith chart constant quality factor semi-circles contours for positive and negative resistance circuits

Mihai Adrian Ionescu, Andrei Müller

The article firstly proves that the constant quality factor (Q) contours for passive circuits, while represented on a 2D Smith chart, form circle arcs on a coaxal circle family. Furthermore, these circle arcs represent semi-circles families in the north he ...

2020

The cup product of Brooks quasimorphisms

Nicolas Monod

We prove the vanishing of the cup product of the bounded cohomology classes associated to any two Brooks quasimorphisms on the free group. This is a consequence of the vanishing of the square of a universal class for tree automorphism groups. ...

WALTER DE GRUYTER GMBH2018

The effect of overall stimulus configuration on crowding

Michael Herzog, Maya Roinishvili, Mattew Pachai

The standard framework to study vision is typically hierarchical and feedforward, which facilitates deconstructing complex mechanisms into smaller, more tractable problems. However, this framework can fail when elements are presented in context, as they ar ...

2017

The effect of “objecthood” in the Ebbinghaus illusion

Michael Herzog, Aline Françoise Cretenoud, Einat Rashal

In the Ebbinghaus illusion, observers overestimate the size of a target when it is surrounded by large flakers and compared with a control target surrounded by small flankers. We examined whether “objecthood” – the degree to which an object is a cohesive e ...

2017

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