—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
—We study two convex optimization problems in a multi-class M/G/1 queue with adjustable service rates: minimizing convex functions of the average delay vector, and minimizing ave...
Abstract—As the rapid expansion of smart phones and associated data-intensive applications continues, we expect to see renewed interest in dynamic prioritization schemes as a way...
Victor Shnayder, Jeremy Hoon, David C. Parkes, Vik...
—This paper discusses a way to communicate without relying on fixed infrastructure at some central hub. This can be useful for bootstrapping loosely connected peer-to-peer syste...
Abstract—This paper focuses on designing a distributed medium access control algorithm that aims at achieving time fairness among contending stations and throughput maximization ...
Yuan Le, Liran Ma, Wei Cheng, Xiuzhen Cheng, Biao ...