Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...
Since web workloads are known to vary dynamically with time, in this paper, we argue that dynamic resource allocation techniques are necessary to provide guarantees to web applicat...
Collaborative filtering systems help address information overload by using the opinions of users in a community to make personal recommendations for documents to each user. Many c...
Badrul M. Sarwar, Joseph A. Konstan, Al Borchers, ...
In wireless sensor networks, multi-hop localization schemes are very vulnerable to various attacks such as wormholes and range modification attacks. In this paper, we propose a rob...
We focus on a multidimensional field with uncorrelated spectrum, and study the quality of the reconstructed signal when the field samples are irregularly spaced and affected by in...