In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
—This paper describes new algorithms for throughput optimization in a mobile backbone network. This hierarchical communication framework combines mobile backbone nodes, which hav...
—In a data center network, for example, it is quite often to use controllers to manage resources in a centralized manner. Centralized control, however, imposes a scalability prob...
We consider the problem of minimizing the cost of the power required to achieve a specified level of quality-of-service (QoS) on a point-to-point link that may be assisted by an ...
— Supporting interactive, multiplayer games on mobile phones over cellular networks is a difficult problem. It is particularly relevant now with the explosion of mostly single-p...
Justin Manweiler, Sharad Agarwal, Ming Zhang, Romi...