2516 search results - page 447 / 504 » When is there a representer theorem |
182
click to vote
FLAIRS
2010
15 years 8 months ago
2010
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...
163
click to vote
ASMTA
2008
Springer
15 years 8 months ago
2008
Springer
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
202
click to vote
ACMSE
2006
ACM
15 years 8 months ago
2006
ACM
A code clone represents a sequence of statements that are duplicated in multiple locations of a program. Clones often arise in source code as a result of multiple cut/paste operat...
173
click to vote
AIML
2008
15 years 7 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
168
click to vote
IJCAI
2007
15 years 7 months ago
2007
The goal of transfer learning is to use the knowledge acquired in a set of source tasks to improve performance in a related but previously unseen target task. In this paper, we pr...