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.
In 1971, the first microprocessor produced in mass production had 2300 transistor and was able to compute 60'000 operations per second at 740 kHz. Nowadays, even a common gaming console uses a central unit including 243 millions of transistors running at 4 ...
This paper introduces p-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latte ...
This paper introduces p-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latter ...
A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We compare and evaluate three different algorithms for automatically extracting temporal interfac ...
We study averaging algorithms in time-varying networks, and means tomeasure their performance. We present sufficient conditions on these algorithms, which ensure they lead to computation at each node, of the global average of measurements provided by each ...
Consider a dense sampling S of the smooth boundary of a planar shape O, i.e., an open subset of R-2. We show that the medial axis of the union of Voronoi balls centered at Voronoi vertices inside O has a particularly simple structure: it is the union of al ...
The perfectly-synchronized round-based model provides the powerful abstraction of crash-stop failures with atomic and synchronous message delivery. This abstraction makes distributed programming very easy.We describe a technique to automatically transform ...
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 ...
In this article is shown that with high probability the thresholding algorithm can recover signals that are sparse in a redundant dictionary as long as the {\it 2-Babel function} is growing slowly. This implies that it can succeed for sparsity levels up to ...
Low-frequency (LF) noise under cyclo-stationary excitation has received considerable attention recently. Until now, only semiempirical models for cyclo-stationary random telegraph signal (RTS) and flicker noise have been reported in the literature. In this ...