2695 search results - page 129 / 539 » Learning Graph Matching |
116
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
The success of kernel methods including support vector machines (SVMs) strongly depends on the design of appropriate kernels. While initially kernels were designed in order to han...
133
Voted
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
131
click to vote
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...
103
click to vote
MLMI
2007
Springer
15 years 8 months ago
2007
Springer
The use of large speech corpora in example-based approaches for speech recognition is mainly focused on increasing the number of examples. This strategy presents some difficulties ...
152
click to vote
TIT
2008
15 years 2 months ago
2008
We consider a framework for semi-supervised learning using spectral decomposition-based unsupervised kernel design. We relate this approach to previously proposed semi-supervised l...