Concept

LU decomposition

Related publications (260)

Mixture Models for the Analysis, Edition, and Synthesis of Continuous Time Series

This chapter presents an overview of techniques used for the analysis, edition, and synthesis of time series, with a particular emphasis on motion data. The use of mixture models allows the decomposition of time signals as a superposition of basis function ...

Springer2019

A proof of a sumset conjecture of Erdős

Florian Karl Richter

In this paper we show that every set A ⊂ ℕ with positive density contains B + C for some pair B, C of infinite subsets of ℕ , settling a conjecture of Erdős. The proof features two different decompositions of an arbitrary bounded sequence into a structured ...

2019

Spectral Subspace Analysis for Automatic Assessment of Pathological Speech Intelligibility

Hervé Bourlard, Ina Kodrasi, Parvaneh Janbakhshi

Speech intelligibility is an important assessment criterion of the communicative performance of pathological speakers. To assist clinicians in their assessment, time- and cost-efficient automatic intelligibility measures offering a repeatable and reliable ...

2019

Sign-Changing Solutions for a Class of Zero Mass Nonlocal Schrodinger Equations

We consider the following class of fractional Schrodinger equations: (-Delta)(alpha)u + V(x)u = K(x)f(u) in R-N, where alpha is an element of (0, 1), N > 2 alpha, (-Delta)(alpha) is the fractional Laplacian, V and K are positive continuous functions which ...

2019

Unique decomposition of homogeneous languages and application to isothetic regions

Nicolas René Jean Ninin

A language is said to be homogeneous when all its words have the same length. Homogeneous languages thus form a monoid under concatenation. It becomes freely commutative under the simultaneous actions of every permutation group G(n) on the collection of ho ...

2019

Context-Tree Recommendation vs Matrix-Factorization: Algorithm Selection and Live Users Evaluation

Boi Faltings, Vincent Jean Fabrice Schickel, Stéphane Bernard Martin

We describe the selection, implementation and online evaluation of two e-commerce recommender systems developed with our partner company, Prediggo. The first one is based on the novel method of Bayesian Variable-order Markov Modeling (BVMM). The second, SS ...

ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE2019

Mutual Information for Low-Rank Even-Order Symmetric Tensor Factorization

Nicolas Macris, Jean François Emmanuel Barbier, Clément Dominique Luneau

We consider a statistical model for finite-rank symmetric tensor factorization and prove a single-letter variational expression for its mutual information when the tensor is of even order. The proof uses the adaptive interpolation method, for which rank-on ...

IEEE2019

Tensor Robust Pca On Graphs

Pierre Vandergheynst, Nauman Shahid, Francesco Grassi

We propose a graph signal processing framework to overcome the computational burden of Tensor Robust PCA (TRPCA). Our framework also serves as a convex alternative to graph regularized tensor factorization methods. Our method is based on projecting a tenso ...

IEEE2019

Stochastic Gradient Descent for Spectral Embedding with Implicit Orthogonality Constraint

Pascal Frossard, Mireille El Gheche, Giovanni Chierchia

In this paper, we propose a scalable algorithm for spectral embedding. The latter is a standard tool for graph clustering. However, its computational bottleneck is the eigendecomposition of the graph Laplacian matrix, which prevents its application to larg ...

IEEE2019

Mechanistic implications of lanthanum-modification on gold-catalyzed formic acid decomposition under SCR-relevant conditions

Davide Ferri, Oliver Kröcher

The use of formate-based ammonia precursors as alternatives to urea in the selective catalytic reduction (SCR) process requires that formic acid released upon their thermolysis in the hot exhaust is rapidly decomposed to carbon dioxide. This work aims at t ...

ELSEVIER SCIENCE BV2019

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.