2516 search results - page 4 / 504 » When is there a representer theorem |
ICFCA
2007
Springer
13 years 11 months ago
2007
Springer
Several fuzzifications of formal concept analysis have been proposed to deal with uncertainty or incomplete information. In this paper, we focus on the new paradigm of multi-adjoin...
FASE
2000
Springer
13 years 11 months ago
2000
Springer
We present a family of tools for program development and verification, comprising the transformation system TAS and the theorem proving interface IsaWin. Both are based on the theo...
COMBINATORICS
2002
13 years 7 months ago
2002
Suppose G is r-colorable and P V (G) is such that the components of G[P] are far apart. We show that any (r + s)-coloring of G[P] in which each component is s-colored extends to ...
ENTCS
2007
13 years 7 months ago
2007
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
IV
2007
IEEE
14 years 1 months ago
2007
IEEE
Research to date has demonstrated the apparent differences how architects, as ‘experts’ and members of the public as ‘non-experts’ perceive and understand visual represent...