Sciweavers

179 search results - page 8 / 36
» Continuous lunches are free!
Sort
View
CSL
2008
Springer
13 years 8 months ago
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
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...
Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama,...
FOCM
2006
76views more  FOCM 2006»
13 years 7 months ago
The Hopf Algebra of Rooted Trees, Free Lie Algebras, and Lie Series
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...
A. Murua
GECCO
2006
Springer
140views Optimization» more  GECCO 2006»
13 years 11 months ago
A representational ecology for learning classifier systems
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...
James A. R. Marshall, Tim Kovacs
TNN
2008
74views more  TNN 2008»
13 years 7 months ago
Pattern Representation in Feature Extraction and Classifier Design: Matrix Versus Vector
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...
Zhe Wang, Songcan Chen, Jun Liu, Daoqiang Zhang
CALCO
2011
Springer
205views Mathematics» more  CALCO 2011»
12 years 7 months ago
Bases as Coalgebras
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...
Bart Jacobs