47 search results - page 8 / 10 » A tight bound on approximating arbitrary metrics by tree met... |
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
ESA
2010
Springer
13 years 6 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
INFOCOM
2007
IEEE
14 years 1 days ago
2007
IEEE
Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...
ICML
2005
IEEE
14 years 6 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...