Concept

Extension radicielle

Publications associées (40)

On the relaxed maximum-likelihood blind MIMO channel estimation for orthogonal space-time block codes

This paper concerns the maximum-likelihood channel estimation for MIMO systems with orthogonal space-time block codes when the finite alphabet constraint of the signal constellation is relaxed. We study the channel coefficients estimation subspace generate ...

ELSEVIER2020

The Little W-Net That Could: State-of-the-Art Retinal Vessel Segmentation with Minimalistic Models

André Anjos

The segmentation of the retinal vasculature from eye fundus images represents one of the most fundamental tasks in retinal image analysis. Over recent years, increasingly complex approaches based on sophisticated Convolutional Neural Network architectures ...

2020

Multiple ergodic averages along functions from a Hardy field: convergence, recurrence and combinatorial applications

Florian Karl Richter

We obtain new results pertaining to convergence and recurrence of multiple ergodic averages along functions from a Hardy field. Among other things, we confirm some of the conjectures posed by Frantzikinakis in [Fra10; Fra16] and obtain combinatorial applic ...

2020

Extended Scalar Sectors

Jan Steggemann

Extended scalar sectors appear in various extensions of the Standard Model of particle physics, such as supersymmetric models. They are also generic extensions of the Standard Model and can address a number of its shortcomings. Direct searches for addition ...

ANNUAL REVIEWS2020

Hasse principles for multinorm equations

Eva Bayer Fluckiger, Ting-Yu Lee

A classical result of Hasse states that the norm principle holds for finite cyclic extensions of global fields, in other words local norms are global norms. We investigate the norm principle for finite dimensional commutative kale algebras over global fiel ...

2019

Hyper-reduced order models for parametrized unsteady Navier-Stokes equations on domains with variable shape

Andrea Manzoni, Niccolò Dal Santo

In this work, we set up a new, general, and computationally efficient way to tackle parametrized fluid flows modeled through unsteady Navier-Stokes equations defined on domains with variable shape, when relying on the reduced basis method. We easily descri ...

SPRINGER2019

Kinetic Monte Carlo approach to nonequilibrium bosonic systems

Hugo Pierre Alexandre Flayac, Timothy Chi Hin Liew

We consider the use of a kinetic Monte Carlo approach for the description of nonequilibrium bosonic systems, taking nonresonantly excited exciton-polariton condensates and bosonic cascade lasers as examples. In the former case, the considered approach allo ...

Amer Physical Soc2017

Omnidirectional bats, point-to-plane distances, and the price of uniqueness

Martin Vetterli, Ivan Dokmanic, Miranda Krekovic

We study simultaneous localization and mapping with a device that uses reflections to measure its distance from walls. Such a device can be realized acoustically with a synchronized collocated source and receiver; it behaves like a bat with no capacity for ...

Ieee2017

The strength and dislocation microstructure evolution in superalloy microcrystals

Satish I Rao

In this work, the evolution of the dislocations microstructure in single crystal two-phase superalloy microcrystals under monotonic loading has been studied using the three-dimensional discrete dislocation dynamics (DDD) method. The DDD framework has been ...

Elsevier2017

MATHICSE Technical Report : Automatic reduction of PDEs defined on domains with variable shape

Andrea Manzoni, Federico Negri

In this work we propose a new, general and computationally cheap way to tackle parametrized PDEs defined on domains with variable shape when relying on the reduced basis method. We easily describe a domain by boundary parametrizations, and obtain domain de ...

MATHICSE2016

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