Sciweavers

4324 search results - page 294 / 865
» A Generalized Representer Theorem
Sort
View
ENTCS
2007
105views more  ENTCS 2007»
15 years 6 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
ENTCS
2007
109views more  ENTCS 2007»
15 years 6 months ago
Constructive Membership Predicates as Index Types
In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we mo...
James Caldwell, Josef Pohl
IANDC
2000
64views more  IANDC 2000»
15 years 6 months ago
Bisimilarity of Open Terms
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to de ne its closed-instance extension, Rci, which holds for a given pair of ope...
Arend Rensink
DATAMINE
1998
145views more  DATAMINE 1998»
15 years 6 months ago
A Tutorial on Support Vector Machines for Pattern Recognition
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-...
Christopher J. C. Burges
NGC
1998
Springer
115views Communications» more  NGC 1998»
15 years 6 months ago
On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
Maria Paola Bonacina, Jieh Hsiang