In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
Jeremy Frank, James Crawford, Lina Khatib, Ronen I...
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Peak to average power ratio (PAPR) and symbol loss rate (SLR) are two challenges of multicarrier based communications that have recently drawn much attention. High SLR renders the ...
Curve evolution implementations [3][23] [25] of the Mumford-Shah functional [16] are of broad interest in image segmentation. These implementations, however, have initialization p...
Yongsheng Pan, J. Douglas Birdwell, Seddik M. Djou...
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...