226 search results - page 5 / 46 » Approximation algorithm for the kinetic robust K-center prob... |
144
Voted
SODA
1997
ACM
15 years 5 months ago
1997
ACM
The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are widely used because...
131
Voted
PAMI
2011
14 years 10 months ago
2011
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
140
Voted
SIAMMAX
2010
14 years 10 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
140
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
136
Voted
CCCG
1998
15 years 5 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...