Publication

Characterization of the traces on the boundary of functions in magnetic Sobolev spaces

Related publications (34)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On the geometrical interpretation of scale-invariant models of inflation

Georgios Karananas, Javier Rubio

We study the geometrical properties of scale-invariant two-field models of inflation. In particular, we show that when the field-derivative space in the Einstein frame is maximally symmetric during inflation, the inflationary predictions can be universal a ...

Elsevier2016

Erosion of soils due to rainfall impact – An interpolation method

David Andrew Barry, Marc Parlange, Alessandro Brovelli, Seifeddine Jomaa

An approximate analytical solution of the Hairsine-Rose model of erosion is obtained by interpolation of asymptotic expressions for large times and great distances. The solution, when erosion is initiated by rainfall impact, is both simple and accurate. Th ...

Wiley-Blackwell2012

GPU Prefilter for Accurate Cubic B-spline Interpolation

Philippe Thévenaz

Achieving accurate interpolation is an important requirement for many signal-processing applications. While nearest-neighbor and linear interpolation methods are popular due to their native GPU support, they unfortunately result in severe undesirable artif ...

Oxford University Press2012

Reconstruction of Large, Irregularly Sampled Multidimensional Images. A Tensor-Based Approach

Michaël Unser

Many practical applications require the reconstruction of images from irregularly sampled data. The spline formalism offers an attractive framework for solving this problem; the currently available methods, however, are hard to deploy for large-scale inter ...

IEEE2011

Local nonreflecting boundary condition for time-dependent multiple scattering

Imbo Sim

Starting from from a high-order local nonreflecting boundary condition (NBC) for single scattering [25], we derive a local NBC for time-dependent multiple scattering problems in three space dimensions, which is completely local both in space and time. To d ...

2011

Graph-based regularization for spherical signal interpolation

Pascal Frossard, Tamara Tosic

This paper addresses the problem of the interpolation of 2-d spherical signals from non-uniformly sampled and noisy data. We propose a graph-based regularization algorithm to improve the signal reconstructed by local interpolation methods such as nearest n ...

2010

From Lagrange to Shannon...and Back: Another Look at Sampling

Martin Vetterli, Paolo Prandoni

Classical digital signal processing (DSP) lore tells us the tale of a continuous-time primeval signal, of its brutal sampling, and of the magic sinc interpolation that, under the aegis of bandlimitedness, brings the original signal back to (continuous) lif ...

2009

Nonparametric Least Squares Regression for Image Reconstruction on the Sphere

Pascal Frossard, Ivana Tosic, Tamara Tosic

This paper addresses the problem of interpolating signals defined on a 2-d sphere from non-uniform samples. We present an interpolation method based on locally weighted linear and nonlinear regression, which takes into account the differences in importance ...

2009

Interpolation and Symbol Elimination

Laura Ildiko Kovacs

We prove several results related to local proofs, interpolation and superposition calculus and discuss their use in predicate abstraction and invariant generation. Our proofs and results suggest that symbol-eliminating inferences may be an interesting alte ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

A Light Formulation of the E* Interpolated Path Replanner

Roland Philippsen

The E* algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation, it results in more appropriate paths during gradient descent. The underlying formulation is based on interpreting navigation functions a ...

2006