2516 search results - page 32 / 504 » When is there a representer theorem |
157
click to vote
ESOP
2012
Springer
14 years 1 months ago
2012
Springer
Abstract. This paper presents GMeta: a generic framework for firstorder representations of variable binding that provides once and for all many of the so-called infrastructure lem...
179
click to vote
KI
1990
Springer
15 years 10 months ago
1990
Springer
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
179
click to vote
AISC
2008
Springer
15 years 8 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
180
click to vote
NECO
2008
15 years 6 months ago
2008
Deep Belief Networks (DBN) are generative neural network models with many layers of hidden explanatory factors, recently introduced by Hinton et al., along with a greedy layer-wis...
130
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compac...