316 search results - page 35 / 64 » Approximation algorithms for hierarchical location problems |
STOC
2004
ACM
14 years 9 months ago
2004
ACM
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
GLOBECOM
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— The design of efficient and scalable streaming Content Distribution Networks (CDNs) is an open problem of great economic interest. A key decision is the number of repl...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particul...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
MOBIHOC
2006
ACM
14 years 8 months ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...