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.
Signal detection is one of the basic problems in statistical communication theory, and has many applications to contemporary technology, whether in engineering, medical science, or the environment. The most difficult problems are those involving random sig ...
It is well known that a simple binary feedback rate--based congestion avoidance scheme cannot ensure a fairness goal of the Available Bit Rate (ABR) service, namely, max--min fairness. In this paper we show how the rates are distributed for the network con ...
We consider one aspect of the general problem of unicast equation based rate control in the Internet, which we formulate as follows. When a so called ``loss-event" occurs, a data source updates its sending rate by setting it to f(pn^), where $\hat{ ...
Window based network flow control protocols, such as TCP, modulate the number of unacknowledged packets the protocol is allowed to have outstanding. Such protocols change the window size when they receive positive or negative acknowledgments, where the lat ...
Window based network flow control protocols, such as TCP, modulate the number of unacknowledged packets the protocol is allowed to have outstanding. Such protocols change the size when they receive positive or negative acknowledgements, where the latter ki ...
This paper addresses the problem of robust exponential filtering for discrete uncertain systems with mixed stochastic and deterministic uncertainties, in addition to unmodelled nonlinearities and measurement and process noises with bounded variances. ...
We consider stochastic guarantees for networks with aggregate scheduling, in particular, Expedited Forwarding (EF). Our approach is based on the assumption that a node can be abstracted by a service curve, and the input flows are regulated individually at ...
We consider stochastic guarantees for networks with aggregate scheduling, in particular, Expedited Forwarding (EF). Our approach is based on the assumption that a node can be abstracted by a service curve, and the input flows are regulated individually at ...
It is well known that a simple binary feedback rate--based congestion avoidance scheme cannot ensure a fairness goal of the Available Bit Rate (ABR) service, namely, max-min fairness. In this paper we show how the rates are distributed for the network cons ...
Simple stochastic models Rt to time series of daily precipitation amount have a marked tendency to underestimate the observed (or interannual) variance of monthly (or seasonal) total precipitation. By considering extensions of one particular class of stoch ...