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.
Microsimulation of transportation and land use evolution require base year, individual characteristics and disaggregate locations of the households and persons living in the study area. On the other hand at best, the census and travel survey, which are the ...
Motivated by the need to smooth and to summarize multiple simultaneous time series arising from networks of environmental monitors, we propose a hierarchical wavelet model for which estimation of hyperparameters can be performed by marginal maximum likelih ...
A new strategy for the synthesis of benzo[de][1,6]naphthyridine derivative 2,3,3a,4,5,6-hexahydroaaptamine, which involves the construction of the isoquinoline ring after elaboration of the quinoline moiety, is described. Since 2,3,3a,4,5,6-hexahydroaaptam ...
We study the problem of distributed least-squares estimation over ad hoc adaptive networks, where the nodes have a common objective to estimate and track a parameter vector. We consider the case where there is stationary additive colored noise on both the ...
The large variability of the drop size distribution (DSD) in space and time must be taken into account to improve remote sensing of precipitation. The ability to simulate a large number of 2D fields of DSD sharing the same statistical properties provides a ...
A network in which sensors observe a common Gaussian source is analyzed. Using a fixed linear transform, each sensor compresses its high-dimensional observation into a low-dimensional representation. The latter is provided to a central decoder that reconst ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
We study complexity and approximation of MIN WEIGHTED NODE COLORING in planar, bipartite and split graphs. We show that this problem is NP-hard in planar graphs, even if they are triangle-free and their maximum degree is bounded above by 4. Then, we prove ...
We consider multiple description source coding problem with Gaussian source and mean squared error, for K=3 descriptions. We obtain an outer bound for the rate region of the problem. We also derive an inner bound for the problem based on successively ref ...
An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared error for a strategy that consists of repeatedly quantizing the source, transmit ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010
We investigate the problem of the optimal reconstruction of a generalized Poisson process from its noisy samples. The process is known to have a finite rate of innovation since it is generated by a random stream of Diracs with a finite average number of i ...
