5595 search results - page 188 / 1119 » Approximation Algorithms for Clustering Problems |
155
Voted
WEA
2007
Springer
16 years 4 days ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
157
click to vote
JC
2008
15 years 6 months ago
2008
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
142
click to vote
JSSPP
2005
Springer
15 years 11 months ago
2005
Springer
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
151
click to vote
ICIP
1995
IEEE
15 years 9 months ago
1995
IEEE
We consider a general weighted least squares approximation problem with a membrane spline regularization term. The key parameters in this formulation are the weighting factors whi...
133
click to vote
PAMI
2010
15 years 4 months ago
2010
—Multigrid solvers proved very efficient for solving massive systems of equations in various fields. These solvers are based on iterative relaxation schemes together with the app...