This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
Nodes in a cognitive radio mesh network may select from a set of available channels to use provided they do not interfere with primary users. This ability can improve overall netwo...
Brendan Mumey, Xia Zhao, Jian Tang, Richard S. Wol...
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
Eden Chlamtac, Robert Krauthgamer, Prasad Raghaven...
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...