Sciweavers

453 search results - page 26 / 91
» On Approximation of Bookmark Assignments
Sort
View
PODS
2008
ACM
159views Database» more  PODS 2008»
14 years 7 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 2 months ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
Sara Ahmadian, Chaitanya Swamy
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 2 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
13 years 9 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
MONET
2008
135views more  MONET 2008»
13 years 7 months ago
Understanding the Power of Distributed Coordination for Dynamic Spectrum Management
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, w...
Lili Cao, Haitao Zheng