3875 search results - page 286 / 775 » Approximation algorithms for the 0-extension problem |
129
click to vote
CCCG
2010
15 years 8 months ago
2010
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
191
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
165
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...
146
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...