We consider a wireless collision channel, shared by a finite number of users who transmit to a common base station. Each user wishes to minimize its average transmission rate (or p...
This paper investigates the decentralized detection of Hidden Markov Processes using the NeymanPearson test. We consider a network formed by a large number of distributed sensors....
Joffrey Villard, Pascal Bianchi, Eric Moulines, Pa...
—Motivated by questions in lossy data compression and by theoretical considerations, the problem of estimating the rate-distortion function of an unknown (not necessarily discret...
Abstract—We introduce a rate-based congestion control mechanism for Content-Centric Networking (CCN). It builds on the fact that one Interest retrieves at most one Data packet. C...
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0=t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms ...