Concept

Extension séparable

Publications associées (18)

Extensions of Peer Prediction Incentive Mechanisms

As large, data-driven artificial intelligence models become ubiquitous, guaranteeing high data quality is imperative for constructing models. Crowdsourcing, community sensing, and data filtering have long been the standard approaches to guaranteeing or imp ...

EPFL2024

Scattering from Time-Modulated Transmission-Line Loads: Theory and Experiments in Acoustics

Romain Christophe Rémy Fleury, Matthieu Francis Malléjac

Scattering wave systems that are periodically modulated in time offer many new degrees of freedom to control waves in both the spatial and frequency domains. Such systems, albeit linear, do not conserve frequency and require the adaptation of the usual the ...

American Physical Society (APS)2023

Minimal graphs for 2-factor extension

Dominique de Werra

Let G = (V, E) be a simple loopless finite undirected graph. We say that G is (2-factor) expandable if for any non-edge uv, G + uv has a 2-factor F that contains uv. We are interested in the following: Given a positive integer n = vertical bar V vertical b ...

ELSEVIER2020

Recursive blocked algorithms for linear systems with Kronecker product structure

Daniel Kressner

Recursive blocked algorithms have proven to be highly efficient at the numerical solution of the Sylvester matrix equation and its generalizations. In this work, we show that these algorithms extend in a seamless fashion to higher-dimensional variants of g ...

SPRINGER2020

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

Depth of field extension through polarization aberrations

Alessandro Grosso

This paper focuses on depth of field (DOF) extension through polarization aberrations. The addition of polarizing elements into an optical system allows to exploit the polarization of the incoming light as an additional degree of freedom in the optical sys ...

SPIE-INT SOC OPTICAL ENGINEERING2019

On Herz'S Extension Theorem

Antoine Derighetti

We present a self-contained proof of the following famous extension theorem due to Carl Herz. A closed subgroup H of a locally compact group G is a set of p-synthesis in G if and only if, for every u is an element of A(p)(H) boolean AND C-00(H) and for eve ...

TUSI MATHEMATICAL RESEARCH GROUP2019

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

Towards the use of UHPFRC in railway bridges: the rehabilitation of Buna Bridge

Eugen Brühwiler, Dragan Damjanovic

In the last decade, Ultra High Performance Fibre Reinforced cement-based Composites (UHPFRC) have been increasingly implemented for rehabilitation and strengthening purposes, rendering outstanding results. The ease of application, along with their superior ...

CRC PRESS-TAYLOR & FRANCIS GROUP2019

Topological principles and developmental algorithms might refine diffusion tractography

Jean-Philippe Thiran, Gabriel Girard, Alessandro Daducci, Maxime Descoteaux, Giorgio Innocenti, Tim Bjørn Dyrby

The identification and reconstruction of axonal pathways in the living brain or “ex-vivo” is promising a revolution in connectivity studies bridging the gap from animal to human neuroanatomy with extensions to brain structural–functional correlates. Unfort ...

2019

A Functional Framework For Ultrasound Imaging

Paul Hurley, Matthieu Martin Jean-André Simeoni

Delay-And-Sum (DAS), the state-of-art in ultrasound imaging, is known to be sub-optimal, resulting in low resolution and contrast. Most proposed improvements involve ad-hoc re-weighting, or hit computational bottlenecks given real-time requirements. This p ...

IEEE2018

Linking interactive optimization for urban planning with a semantic 3D city model

François Maréchal, Sébastien Cajot, Nils Christian Schüler

The cities in which we live are constantly evolving. The active management of this evolution is referred to as urban planning. The according development process could go in many directions resulting in a large number of potential future scenarios of a city ...

Copernicus GmbH2018

Reductive overgroups of distinguished unipotent elements in simple algebraic groups

Mikko Tapani Korhonen

Let

G

be a simple linear algebraic group over an algebraically closed field

K

of characteristic

p \geq 0

. In this thesis, we investigate closed connected reductive subgroups

X < G

that contain a given distinguished unipotent element

u

G

. Our ...

EPFL2018

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

Some applications of smooth bilinear forms with Kloosterman sums

Philippe Michel

We revisit a recent bound of I. Shparlinski and T. Zhang on bilinear forms with Kloosterman sums, and prove an extension for correlation sums of Kloosterman sums against Fourier coefficients of modular forms. We use these bounds to improve on earlier resul ...

Maik Nauka/Interperiodica/Springer2017

On the discrete logarithm problem in finite fields of fixed characteristic

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For~

q

a prime power, the discrete logarithm problem (DLP) in~

\F_{q}

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer~

x

such that

g^x = h

. We present an algorithm for computing discrete logarithm ...

2018

Special Reductive Groups Over An Arbitrary Field

Mathieu Huruguen

A linear algebraic group G defined over a field k is called special if every G-torsor over every field extension of k is trivial. In 1958 Grothendieck classified special groups in the case where the base field is algebraically closed. In this paper we desc ...

Springer Birkhauser2016

A Model of Synaptic Reconsolidation

Wulfram Gerstner, Tilo Schwalger, Lorric Ziegler, David Barak Kastner

Reconsolidation of memories has mostly been studied at the behavioral and molecular level. Here, we put forward a simple extension of existing computational models of synaptic consolidation to capture hippocampal slice experiments that have been interprete ...

Frontiers Research Foundation2016