Functional Tucker Approximation Using Chebyshev Interpolation

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.

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. ...

The evaluation of small degree polynomials is critical for the computation of elementary functions. It has been extensively studied and is well documented. In this article, we evaluate existing methods for polynomial evaluation on superscalar architecture. ...

In this work, we consider the approximation of Hilbert space-valued meromorphic functions that arise as solution maps of parametric PDEs whose operator is the shift of an operator with normal and compact resolvent, e.g., the Helmholtz equation. In this res ...

Many engineering fields rely on frequency-domain dynamical systems for the mathematical modeling of physical (electrical/mechanical/etc.) structures. With the growing need for more accurate and reliable results, the computational burden incurred by frequen ...

We consider the problem of non-negative super-resolution, which concerns reconstructing a non-negative signal x = Sigma(k )(i=1)a(i)delta(ti) from m samples of its convolution with a window function phi(s - t), of the form y(s(j)) = Sigma(k)(i=1) a(i) phi( ...

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 ...

Motivation: The majority of genome analysis tools and pipelines require data to be decrypted for access. This potentially leaves sensitive genetic data exposed, either because the unencrypted data is not removed after analysis, or because the data leaves t ...

In this paper we construct an explicit interpolation formula for Schwartz functions on the real line. The formula expresses the value of a function at any given point in terms of the values of the function and its Fourier transform on the set {0,+/- 1,+/- ...

Many research questions involve time-to-event outcomes that can be prevented from occurring due to competing events. In these settings, we must be careful about the causal interpretation of classical statistical estimands. In particular, estimands on the h ...

We introduce a new method to price American options based on Chebyshev interpolation. In each step of a dynamic programming time-stepping we approximate the value function with Chebyshev polynomials. The key advantage of this approach is that it allows us ...

While the basic greedy algorithm gives a semi-streaming algorithm with an approximation guarantee of 2 for the unweighted matching problem, it was only recently that Paz and Schwartzman obtained an analogous result for weighted instances. Their approach is ...

In order to simulate the cardiac function for a patient-specific geometry, the generation of the computational mesh is crucially important. In practice, the input is typically a set of unprocessed polygonal surfaces coming either from a template geometry o ...

We consider rank-1 lattices for integration and reconstruction of functions with series expansion supported on a finite index set. We explore the connection between the periodic Fourier space and the non-periodic cosine space and Chebyshev space, via tent ...

At the beginning of the 19th century, the Napoleonic administration introduced a new standardised description system to give an objective account of the form and functions of the city of Venice. The cadastre, deployed on a European scale, was offering for ...

Standard interpolation techniques are implicitly based on the assumption that the signal lies on a single homogeneous domain. In contrast, many naturally occurring signals lie on an inhomogeneous domain, such as brain activity associated to different brain ...

Every Gelfand pair (G, K) admits a decomposition G = K P, where P < G is an amenable subgroup. In particular, the Furstenberg boundary of G is homogeneous. Applications include the complete classification of non-positively curved Gelfand pairs, relying on ...

The Bidirectional Texture Function (BTF) is a data-driven solution to render materials with complex appearance. A typical capture contains tens of thousands of images of a material sample under varying viewing and lighting conditions. While capable of fait ...

Treating high dimensionality is one of the main challenges in the development of computational methods for solving problems arising in finance, where tasks such as pricing, calibration, and risk assessment need to be performed accurately and in real-time. ...

Statistical methods for inference on spatial extremes of large datasets are yet to be developed. Motivated by standard dimension reduction techniques used in spatial statistics, we propose an approach based on empirical basis functions to explore and model ...

We consider various versions of the obstacle and thin-obstacle problems, we interpret them as variational inequalities, with non-smooth constraint, and prove that they satisfy a new constrained Lojasiewicz inequality. The difficulty lies in the fact that, ...

Functional Tucker Approximation Using Chebyshev Interpolation

Chat with Graph Search

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Polynomial Evaluation on Superscalar Architecture, Applied to the Elementary Function e(x)

Fast Least-Squares Padé approximation of problems with normal operators and meromorphic structure

Model order reduction based on functional rational approximants for parametric PDEs with meromorphic structure

Sparse non-negative super-resolution - simplified and stabilised

A Spectral Algorithm for 3-valued Function Equivalence Classification

Crypt4GH: a file format standard enabling native access to encrypted data

Fourier interpolation on the real line

Estimation of separable direct and indirect effects in continuous time

A New Approach For American Option Pricing: The Dynamic Chebyshev Method

Semi-streaming Algorithms for Submodular Matroid Intersection

Polygonal surface processing and mesh generation tools for the numerical simulation of the cardiac function

Function Integration, Reconstruction And Approximation Using Rank-1 Lattices

Une approche computationnelle du cadastre napoléonien de Venise

Domain-Informed Spline Interpolation

Gelfand pairs admit an Iwasawa decomposition

Neural BTF Compression and Interpolation

Low-Rank Tensor Approximation for Chebyshev Interpolation in Parametric Option Pricing

Exploration and Inference in Spatial Extremes Using Empirical Basis Functions

On the asymptotic behavior of the solutions to parabolic variational inequalities