7006 search results - page 543 / 1402 » Approximation Algorithms |
212
click to vote
JMLR
2010
15 years 5 months ago
2010
A large number of learning algorithms, for example, spectral clustering, kernel Principal Components Analysis and many manifold methods are based on estimating eigenvalues and eig...
206
click to vote
VMV
2007
15 years 7 months ago
2007
We present an algorithm for the efficient and accurate computation of geodesic distance fields on triangle meshes. We generalize the algorithm originally proposed by Surazhsky e...
211
Voted
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
The choice of the kernel function which determines the mapping between the input space and the feature space is of crucial importance to kernel methods. The past few years have se...
175
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
204
click to vote
SMI
2006
IEEE
16 years 20 days ago
2006
IEEE
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...