2516 search results - page 26 / 504 » When is there a representer theorem |
147
click to vote
CSFW
2008
IEEE
16 years 19 days ago
2008
IEEE
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
172
click to vote
EMO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The classic NFL theorems are invariably cast in terms of single objective optimization problems. We confirm that the classic NFL theorem holds for general multiobjective ...
159
click to vote
FPCA
1989
15 years 10 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
274
Voted
POPL
2004
ACM
16 years 6 months ago
2004
ACM
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
167
click to vote
CADE
2007
Springer
16 years 10 days ago
2007
Springer
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...