2516 search results - page 7 / 504 » When is there a representer theorem |
ACL2
2006
ACM
14 years 1 months ago
2006
ACM
We introduce the logical story behind file input in ACL2 and discuss the types of theorems that can be proven about filereading operations. We develop a low level library for re...
DM
1999
13 years 7 months ago
1999
Abstract. Given a partially ordered set P = (X; P ), a function F which assigns to each x 2 X a set F (x) so that x y in P if and only if F (x) F (y) is called an inclusion represe...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Preferences of a single agent are often partially ordered. For example, it may be hard to compare a novel with a biography. In such a situation, the agent may want the novel and t...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
ISIPTA
2003
IEEE
14 years 19 days ago
2003
IEEE
This paper studies the possibility of representing lower previsions by continuous linear functionals. We prove the existence of a linear isomorphism between the linear space spann...