Suppose there are n applications and n processors. A pair cover is a set S of one-to-one mappings (assignments) of the applications to the processors such that, for every pair (Ai...
Wolfgang W. Bein, Shahram Latifi, Linda Morales, I...
Wireless networking has become a popular topic in both undergraduate and graduate courses. However, putting together good assignments in wireless networking is difficult because t...
In this paper we explore the use of category information for ad hoc retrieval in Wikipedia. We show that techniques for entity ranking exploiting this category information can als...
Abstract-Search engines, such as Google, assign scores to news articles based on their relevancy to a query. However, not all relevant articles for the query may be interesting to ...
Raymond K. Pon, Alfonso F. Cardenas, David Buttler...
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
James Aspnes, Jonathan Kirsch, Arvind Krishnamurth...