1542 search results - page 145 / 309 » Kernelization of packing problems |
200
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
191
click to vote
ICIP
2008
IEEE
16 years 8 months ago
2008
IEEE
We present a novel approach to the problem of detection of visual similarity between a template image, and patches in a given image. The method is based on the computation of a lo...
188
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
174
click to vote
ALT
2007
Springer
16 years 3 months ago
2007
Springer
In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classific...
202
click to vote
ICPP
2009
IEEE
16 years 1 months ago
2009
IEEE
—Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architec...