1416 search results - page 144 / 284 » The Kernel Least-Mean-Square Algorithm |
161
Voted
FAW
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
143
Voted
IWPEC
2004
Springer
15 years 9 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
131
Voted
GBRPR
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
146
Voted
ICANN
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. In this paper, we propose and study a new on-line algorithm for learning a SVM based on Radial Basis Function Kernel: Local Incremental Learning of SVM or LISVM. Our meth...
140
Voted
WSCG
2000
15 years 5 months ago
2000
Image filtering is often applied as a post-process to Monte Carlo generated pictures, in order to reduce noise. In this paper we present an algorithm based on density estimation t...