5595 search results - page 392 / 1119 » Approximation Algorithms for Clustering Problems |
204
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
167
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We present a novel algorithm for approximating the parameters of a multivariate t-distribution. At the expense of a slightly decreased accuracy in the estimates, the prop...
183
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Asian options are path-dependent derivatives. How to price them efficiently and accurately has been a longstanding research and practical problem. Asian options can be priced on t...
194
click to vote
ICCCN
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such “services” are typically performed on ...
147
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
Given a point set P R2 , a subset Q P is an -kernel of P if for every slab W containing Q, the (1+)-expansion of W also contains P. We present a data-stream algorithm for mainta...