3096 search results - page 116 / 620 » The Generalized FITC Approximation |
134
click to vote
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
110
Voted
IWANN
2009
Springer
15 years 7 months ago
2009
Springer
We propose a general method for estimating the distance between a compact subspace K of the space L1 ([0, 1]s ) of Lebesgue measurable functions defined on the hypercube [0, 1]s ,...
122
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
106
click to vote
DAGSTUHL
2007
15 years 4 months ago
2007
Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensi...
117
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...