Concept

Combinaison barycentrique

Publications associées (190)

Existence of dynamical low rank approximations for random semi-linear evolutionary equations on the maximal interval

An existence result is presented for the dynamical low rank (DLR) approximation for random semi-linear evolutionary equations. The DLR solution approximates the true solution at each time instant by a linear combination of products of deterministic and sto ...

2020

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

In a seminal work, Micciancio and Voulgaris (SIAM J Comput 42(3):1364-1391, 2013) described a deterministic single-exponential time algorithm for the closest vector problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given ...

SPRINGER HEIDELBERG2020

Functional Inverse Problems on Spheres: Theory, Algorithms and Applications

Matthieu Martin Jean-André Simeoni

Many scientific inquiries in natural sciences involve approximating a spherical field -namely a scalar quantity defined over a continuum of directions- from generalised samples of the latter (e.g. directional samples, local averages, etc). Such an approxim ...

EPFL2020

A non-intrusive multifidelity method for the reduced order modeling of nonlinear problems

Jan Sickmann Hesthaven, Mariella Kast, Mengwu Guo

We propose a non-intrusive reduced basis (RB) method for parametrized nonlinear partial differential equations (PDEs) that leverages models of different accuracy. From a collection of low-fidelity (LF) snapshots, parameter locations are extracted for the e ...

ELSEVIER SCIENCE SA2020

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

Localized Spectral Graph Filter Frames: A Unifying Framework, Survey of Design Considerations, and Numerical Comparison

David Shuman

A major line of work in graph signal processing [2] during the past 10 years has been to design new transform methods that account for the underlying graph structure to identify and exploit structure in data residing on a connected, weighted, undirected gr ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

COVID-19 epidemic in Switzerland: on the importance of testing, contact tracing and isolation

Switzerland is among the countries with the highest number of coronavirus disease-2019 (COVID-19) cases per capita in the world. There are likely many people with undetected SARS-CoV-2 infection because testing efforts are currently not detecting all infec ...

2020

Fair Colorful k-Center Clustering

Ola Nils Anders Svensson, Xinrui Jia

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius ρ such that there exist balls of radius ρ around ...

Springer2020

Exponential Collapse Of Social Beliefs Over Weakly-Connected Heterogeneous Networks

Ali H. Sayed, Augusto José Rabelo Almeida Santos

We consider a distributed social learning problem where a network of agents is interested in selecting one among a finite number of hypotheses. The data collected by the agents might be heterogeneous, meaning that different sub-networks might observe data ...

IEEE2019

Characterization of multi-channel intraneural stimulation in transradial amputees

Silvestro Micera, Stanisa Raspopovic, Fiorenzo Artoni, Francesco Maria Petrini, Ivo Strauss, Giacomo Valle, Edoardo D'Anna

Although peripheral nerve stimulation using intraneural electrodes has been shown to be an effective and reliable solution to restore sensory feedback after hand loss, there have been no reports on the characterization of multi-channel stimulation. A deepe ...

Springer2019

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