2516 search results - page 10 / 504 » When is there a representer theorem |
ICPR
2002
IEEE
14 years 2 months ago
2002
IEEE
The Non-negative Matrix Factorization technique (NMF) has been recently proposed for dimensionality reduction. NMF is capable to produce a region- or partbased representation of o...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
We present a novel approach to knowledge-based automated oneshot multi-issue bilateral negotiation handling, in a homogeneous setting, both numerical features and non-numerical on...
CADE
2004
Springer
14 years 10 months ago
2004
Springer
This paper presents the Dr.Doodle system, an interactive theorem prover that uses diagrammatic representations. The assumption underlying this project is that, for some domains (pr...
CEC
2008
IEEE
14 years 4 months ago
2008
IEEE
—Representation techniques are important issues when designing successful evolutionary algorithms. Within this field the use of neutrality plays an important role. We examine th...
CADE
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...