Concept

Relation d'équivalence

Publications associées (60)

A Spectral Algorithm for 3-valued Function Equivalence Classification

Spectral techniques for Boolean and multiple-valued functions have been well studied and found to be useful in logic design and testing for conventional circuits. Spectral techniques also have potential application for reversible and quantum circuits. This ...

OLD CITY PUBLISHING INC2020

On two isomorphic Lie algebroids associated with feedback linearization

Philippe Müllhaupt

We present two Lie algebroids linked to the construction of the linearizing output of an input affine nonlinear system. The algorithmic development of the linearizing output proceeds inductively, and each stage has two structures, namely a codimension one ...

ELSEVIER2019

On two isomorphic Lie algebroids for Feedback Linearization

Philippe Müllhaupt

Two Lie algebroids are presented that are linked to the construction of the linearizing output of an affine in the input nonlinear system.\ The algorithmic construction of the linearizing output proceeds inductively, and each stage has two structures, name ...

2019

A Hybrid Method for Spectral Translation Equivalent Boolean Functions

Giovanni De Micheli, Mathias Soeken, Eleonora Testa

The equivalence of Boolean functions with respect to five invariance (aka translation) operations has been well considered with respect to the Rademacher-Walsh spectral domain. In this paper, we introduce a hybrid approach that uses both the Reed-Muller an ...

IEEE2019

Quantitative estimate on singularities in isoperimetric clusters

Maria Colombo

We prove a quantitative estimate on the number of certain singularities in almost minimizing clusters. In particular, we consider the singular points belonging to the lowest stratum of the Federer-Almgren stratification (namely, where each tangent cone doe ...

2019

Kazhdan's Property (T) and Property (FH) for measured groupoids

Christophe Michel Gippa

Introduced 50 years ago by David Kazhdan, Kazhdan's Property (T) has quickly become an active research area in mathematics, with a lot of important results. A few years later, this property has been generalized to discrete group actions by Robert J. Zimmer ...

EPFL2018

Shape from bandwidth: the 2-D orthogonal projection case

Martin Vetterli, Benjamin Bejar Haro, Adam James Scholefield

Could bandwidth—one of the most classic concepts in signal processing—have a new purpose? In this paper, we investigate the feasibility of using bandwidth to infer shape from a single image. As a first analysis, we limit our attention to orthographic proje ...

Ieee2017

Heuristic NPN classification for large functions using AIGs and LEXSAT

Giovanni De Micheli, Paolo Ienne, Mathias Soeken, Ana Petkovska

Two Boolean functions are NPN equivalent if one can be ob- tained from the other by negating inputs, permuting inputs, or negating the output. NPN equivalence is an equivalence relation and the number of equivalence classes is significantly smaller than th ...

Springer Int Publishing Ag2016

Local Refinement for 3D Deformable Parametric Surfaces

Michaël Unser, Daniel Andreas Schmitter, Anaïs Laure Marie-Thérèse Badoual

Biomedical image segmentation is an active field of research where deformable models have proved to be efficient. The geometric representation of such models determines their ability to approximate the shape of interest as well as the speed of convergence ...

IEEE2016

Polynomiality of Hurwitz numbers, Bouchard-Marino conjecture, and a new proof of the ELSV formula

Nicolas Gerson Orantin

In this paper we give a new proof of the ELSV formula. First, we refine an argument of Okounkov and Pandharipande in order to prove (quasi-)polynomiality of Hurwitz numbers without using the ELSV formula (the only way to do that before used the ELSV formul ...

Academic Press Inc Elsevier Science2015

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