1082 search results - page 119 / 217 » Approximation Algorithms for Spreading Points |
DCG
2008
13 years 9 months ago
2008
We present a novel reconstruction algorithm that, given an input point set sampled from an object S, builds a one-parameter family of complexes that approximate S at different sca...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
PODS
2003
ACM
14 years 9 months ago
2003
ACM
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 ...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
IMC
2010
ACM
13 years 7 months ago
2010
ACM
Current large-scale topology mapping systems require multiple days to characterize the Internet due to the large amount of probing traffic they incur. The accuracy of maps from ex...