Sciweavers

510 search results - page 56 / 102
» Adaptive Distances on Sets of Vectors
Sort
View
SIAMSC
2010
165views more  SIAMSC 2010»
14 years 8 months ago
Algebraic Multigrid for Markov Chains
Abstract. An algebraic multigrid (AMG) method is presented for the calculation of the stationary probability vector of an irreducible Markov chain. The method is based on standard ...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...
BMCBI
2008
228views more  BMCBI 2008»
14 years 10 months ago
Adaptive diffusion kernel learning from biological networks for protein function prediction
Background: Machine-learning tools have gained considerable attention during the last few years for analyzing biological networks for protein function prediction. Kernel methods a...
Liang Sun, Shuiwang Ji, Jieping Ye
71
Voted
CEC
2005
IEEE
15 years 3 months ago
On the complexity of overcoming gaps with isotropic mutations and elitist selection
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
Jens Jägersküpper
DCC
1995
IEEE
15 years 1 months ago
Quantization of Overcomplete Expansions
The use of overcomplete sets of vectors (redundant bases or frames) together with quantization is explored as an alternative to transform coding for signal compression. The goal i...
Vivek K. Goyal, Martin Vetterli, Nguyen T. Thao
ICML
2003
IEEE
15 years 11 months ago
The Pre-Image Problem in Kernel Methods
In this paper, we address the problem of finding the pre-image of a feature vector in the feature space induced by a kernel. This is of central importance in some kernel applicatio...
James T. Kwok, Ivor W. Tsang