2516 search results - page 53 / 504 » When is there a representer theorem |
158
click to vote
ISMVL
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper considers quasi-reduced multi-valued decision diagrams with bits (QRMDD( )s) to represent twovalued logic functions. It shows relations between the numbers of nodes in ...
131
click to vote
SIAMDM
2010
15 years 1 months ago
2010
We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn . This result extends a theorem of Lov
163
click to vote
FOCI
2007
IEEE
16 years 18 days ago
2007
IEEE
Abstract— Centroid, cardinality, fuzziness, variance and skewness are all important concepts for an interval type-2 fuzzy set (IT2 FS) because they are all measures of uncertaint...
177
click to vote
LICS
2006
IEEE
16 years 8 days ago
2006
IEEE
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
164
click to vote
CONTEXT
1999
Springer
15 years 10 months ago
1999
Springer
Appeared in: P. Bouquet, P. Br´ezillon, L. Serafini, M. Benerecetti, F. Castellani (Eds.), 2nd International and Interdisciplinary Conference on Modeling and Using Context (CONT...