An efficient algorithm for real-time estimation and prediction of dynamic OD table
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.
The Fourier spectrum is often not sufficient to discriminate complex signals because it does not take into account higher-order moments. Wide Sense Stationarity is for sure not sufficient to characterize the signal as it considers only moments of order 2. ...
We propose two new alternating direction methods to solve “fully” nonsmooth constrained convex problems. Our algorithms have the best known worst-case iteration-complexity guarantee under mild assumptions for both the objective residual and feasibility gap ...
This work analyses the temporal and spatial characteristics of bioclimatic conditions in the Lower Silesia region. The daily time values (12UTC) of meteorological variables in the period 1966–2017 from seven synoptic stations of the Institute of Meteorolog ...
This paper proposes a technique for the simultaneous estimation of interference phase derivative and phase from a complex interferogram recorded in an optical interferometric setup. The complex interferogram is represented as a spatially varying autoregres ...
We present a novel implementation strategy for distributed autoregressive moving average (ARMA) graph filters. Differently from the state of the art implementation, the proposed approach has the following benefits: (i) the designed filter coefficients come ...
We investigate regularized algorithms combining with projection for least-squares regression problem over a Hilbert space, covering nonparametric regression over a reproducing kernel Hilbert space. We prove convergence results with respect to variants of n ...
The method of symmetrical components is not effective for fault location in the case of untransposed lines, due to potential couplings between the sequence circuits. This paper proposes a non-iterative algorithm in the phase-coordinates for wide-area fault ...
Institute of Electrical and Electronics Engineers2016
Visual crowding is the inability to perceive elements within clutter. Traditional crowding models, such as pooling, predict that performance deteriorates when flankers are added. However, this prediction has been disproved. For example, performance was fou ...
In this paper, the problem of speech source localization and separation from recordings of convolutive underdetermined mixtures is studied. The problem is cast as recovering the spatio-spectral speech information embedded in a microphone array compressed m ...
We introduce in this paper the recursive Hessian sketch, a new adaptive filtering algorithm based on sketching the same exponentially weighted least squares problem solved by the recursive least squares algorithm. The algorithm maintains a number of sketch ...
