Sciweavers

4324 search results - page 21 / 865
» A Generalized Representer Theorem
Sort
View
CSL
2010
Springer
13 years 8 months ago
Exact Exploration and Hanging Algorithms
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
ICML
2004
IEEE
14 years 8 months ago
Learning with non-positive kernels
In this paper we show that many kernel methods can be adapted to deal with indefinite kernels, that is, kernels which are not positive semidefinite. They do not satisfy Mercer...
Alexander J. Smola, Cheng Soon Ong, Stéphan...
SAT
2007
Springer
96views Hardware» more  SAT 2007»
14 years 1 months ago
From Idempotent Generalized Boolean Assignments to Multi-bit Search
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
Marijn Heule, Hans van Maaren
CIARP
2007
Springer
14 years 1 months ago
Generalizing Dissimilarity Representations Using Feature Lines
A crucial issue in dissimilarity-based classification is the choice of the representation set. In the small sample case, classifiers capable of a good generalization and the inje...
Mauricio Orozco-Alzate, Robert P. W. Duin, C&eacut...
ESOP
2011
Springer
12 years 11 months ago
General Bindings and Alpha-Equivalence in Nominal Isabelle
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
Christian Urban, Cezary Kaliszyk