4324 search results - page 34 / 865 » A Generalized Representer Theorem |
124
click to vote
SPC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...
159
click to vote
PAMI
2012
13 years 3 months ago
2012
Abstract—We consider two desired properties of learning algorithms: sparsity and algorithmic stability. Both properties are believed to lead to good generalization ability. We sh...
112
Voted
AI
2007
Springer
15 years 24 days ago
2007
Springer
In this paper a theory for the synthesis of geometric concepts is presented. The theory is focused on a constructive process that synthesizes a function in the geometric domain re...
81
Voted
UAI
2004
15 years 2 months ago
2004
We consider the challenge of preference elicitation in systems that help users discover the most desirable item(s) within a given database. Past work on preference elicitation foc...
89
Voted
ER
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We discuss the existence of matrix representations for generalised and minimum participation constraints which are frequently used in database design and conceptual model...