10 search results - page 1 / 2 » Approximating the Best-Fit Tree Under Lp Norms |
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
ICC
2009
IEEE
13 years 11 months ago
2009
IEEE
— In this paper, we introduce an adaptive Lp–norm metric for robust coherent diversity combining in non–Gaussian noise and interference. We derive a general closed–form exp...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
MOR
2007
13 years 4 months ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
FOCS
2008
IEEE
13 years 5 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...