Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...
Chandra Chekuri, F. Bruce Shepherd, Christophe Wei...
Consider the problem of joint parameter estimation and prediction in a Markov random field: i.e., the model parameters are estimated on the basis of an initial set of data, and th...
We consider algorithms for load balancing on unreliable machines. The objective is to optimize the two criteria of minimizing the makespan and minimizing job reassignments in resp...
: Time synchronisation is one of the most important and fundamental middleware services for wireless sensor networks. However, there is an apparent disconnect between existing time...
Branislav Kusy, Prabal Dutta, Philip Levis, Mikl&o...
In recent years, while search engines have become more and more powerful, several specialized search engines have been developed for different domains (e.g. library services, serv...