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 a problem of labeling a memoryless temporal point process. The labelings have to be done causally. We study the tradeoff between the rate and age of the labeled process and characterize the optimal tradeoff curve. We show that the optimal curve can be achieved with rather simple labeling procedures which repeatedly do the following: Wait for T time units and label the next arrival.