We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
Micah Adler, Soumen Chakrabarti, Michael Mitzenmac...
Most image registration problems are formulated in an asymmetric fashion. Given a pair of images, one is implicitly or explicitly regarded as a template, and warped onto the other...
Users of the web are increasingly interested in tracking the appearance of new postings rather than locating existing knowledge. Coupled with this is the emergence of the Web 2.0 ...
John Keeney, Dominic Jones, Dominik Roblek, David ...
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...