439 search results - page 35 / 88 » Weighted decomposition kernels |
NPL
1998
13 years 7 months ago
1998
Abstract. One of the main problems associated with arti cial neural networks online learning methods is the estimation of model order. In this paper, we report about a new approach...
SIAMCOMP
1998
13 years 7 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
JEI
2010
13 years 6 months ago
2010
Abstract. We present an innovative approach to the objective quality evaluation that could be computed using the mean difference between the original and tested images in different...
SDM
2010
SIAM
13 years 9 months ago
2010
SIAM
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
COLT
2005
Springer
14 years 1 months ago
2005
Springer
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...