179 search results - page 8 / 36 » Continuous lunches are free! |
CSL
2008
Springer
15 years 26 days ago
2008
Springer
Abstract. This paper shows undecidability of type-checking and typeinference problems in domain-free typed lambda-calculi with existential types: a negation and conjunction fragmen...
96
Voted
FOCM
2006
14 years 11 months ago
2006
We present an approach that allows performing computations related to the Baker-Campbell-Haussdorff (BCH) formula and its generalizations in an arbitrary Hall basis, using labeled...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
The representation used by a learning algorithm introduces a bias which is more or less well-suited to any given learning problem. It is well known that, across all possible probl...
TNN
2008
14 years 11 months ago
2008
The matrix, as an extended pattern representation to the vector, has proven to be effective in feature extraction. But the subsequent classifier following the matrix-pattern-orien...
134
click to vote
CALCO
2011
Springer
13 years 11 months ago
2011
Springer
Abstract. The free algebra adjunction, between the category of algebras of a monad and the underlying category, induces a comonad on the category of algebras. The coalgebras of thi...