4324 search results - page 137 / 865 » A Generalized Representer Theorem |
170
Voted
AIIA
1991
Springer
15 years 8 months ago
1991
Springer
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
123
click to vote
DAGSTUHL
2008
15 years 6 months ago
2008
An overall approach to the problem of error analysis in the context of solid modelling, analogous to the standard forward/backward error analysis of Numerical Analysis, was describ...
157
click to vote
CADE
2012
Springer
13 years 7 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
132
Voted
WWW
2003
ACM
16 years 5 months ago
2003
ACM
The Sematic Web is vitally dependant on a formal meaning for the constructs of its languages. For Semantic Web languages to work well together their formal meanings must employ a ...
238
click to vote
NAACL
2010
15 years 2 months ago
2010
This paper proposes a general learning framework for a class of problems that require learning over latent intermediate representations. Many natural language processing (NLP) dec...