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.
We consider the problem of minimizing delay when broadcasting over erasure channels with feedback. A sender wishes to communicate the same set of mu messages to several receivers over separate erasure channels. The sender can broadcast a single message or ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reconstructed from a small set of random projections, provided that the signal is sparse i ...
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unconnected facility location problem, randomly sample the clients, and open the ...
We consider a calibration problem, where we determine an unknown sensor location using the known track of a calibration target and a known reference sensor location. We cast the calibration problem as a sparse approximation problem where the unknown sensor ...
This paper deals with model predictive control of uncertain linear discrete-time systems with polytopic constraints on the input and chance constraints on the states. When having polytopic constraints and bounded disturbances, the robust problem with an op ...
This work is concerned with codes, graphs and their links. Graph based codes have recently become very prominent in both information theory literature and practical applications. While most research has centered around their performance under iterative dec ...
In this paper, we introduce the notion of a constrained Minkowski sumwhich for two (finite) point-sets P,Q R2 and a set of k inequalities Ax b is defined as the point-set (P Q)Ax b= x = p+q | P, q Q, Ax b. We show that typical subsequ ...
We present an algorithm for clustering sets of detected interest points into groups that correspond to visually distinct structure. Through the use of a suitable colour and texture representation, our clustering method is able to identify keypoints that be ...
A linear quadratic model predictive controller (MPC) can be written as a parametric quadratic optimization problem whose solution is a piecewise affine (PWA) map from the state to the optimal input. While this `explicit solution' can offer several orders o ...
We consider the problem of minimizing delay when broadcasting over erasure channels with feedback. A sender wishes to communicate the same set of m messages to several receivers. The sender can broadcast a single message or a combination (encoding) of mess ...
