Finite-dimensional approximation of Gaussian processes
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.
This paper aims to start an analytical study of the computational complexity of some online We analyze the following problem. Consider a train station consisting of a set of parallel tracks. Each track can be approached from one side only or from both side ...
Reduction strategies, such as model order reduction (MOR) or reduced basis (RB) methods, in scientic computing may become crucial in applications of increasing complexity. In this paper we review the reduced basis method (built upon a high-delity "truth" f ...
This work deals with the development and application of reduction strategies for real-time and many query problems arising in fluid dynamics, such as shape optimization, shape registration (reconstruction), and shape parametrization. The proposed strategy ...
Many state-of-the-art diarization systems for meeting recordings are based on the HMM/GMM framework and the combination of spectral (MFCC) and time delay of arrivals (TDOA) features. This paper presents an extensive study on how multistream diarization can ...
In this paper we address the combination of multiple feature streams in a fast speaker diarization system for meeting recordings. Whenever Multiple Distant Microphones (MDM) are used, it is possible to estimate the Time Delay of Arrival (TDOA) for differen ...
In this article we develop a systematic approach to enforce strong feasibility of probabilistically constrained stochastic model predictive control problems for linear discrete-time systems under affine disturbance feedback policies. Two approaches are pre ...
Approximation of Toeplitz matrices with circulant matrices is a well-known approach to reduce the computational complexity of linear equalizers. This paper presents a novel technique to compute linear equalizer coefficients in the frequency domain. It is s ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007
Certain aspects of the present disclosure relate to a method for speeding up the Cadzow iterative denoising algorithm as a part of the Finite Rate of Innovation (FRI) processing and for decreasing its computational complexity. ...
This paper presents three novel Moving Horizon Estimation (MHE) methods for discrete-time partitioned linear systems, i.e. systems decomposed into coupled subsystems with non-overlapping states. The MHE approach is used due to its capability of exploiting ...
The k-distance transformation (k-DT) computes the k nearest patterns from each location on a discrete regular grid within a D dimensional volume, which Warfield [Patt. Rec. Letters, 17(1996) 713-721] proposed to implement using 2^D raster scans. We investi ...