180 search results - page 7 / 36 » Self-Assembly of Infinite Structures |
ICANN
2010
Springer
13 years 10 months ago
2010
Springer
It has been one of the great challenges of neuro-symbolic integration to represent recursive logic programs using neural networks of finite size. In this paper, we propose to imple...
IJAC
2008
13 years 9 months ago
2008
We describe a nilpotent quotient algorithm for a certain type of infinite presentations: the so-called finite L-presentations. We then exhibit finite L-presentations for various i...
COLING
1996
13 years 11 months ago
1996
In this paper we present a GB-parsing system for German and in particular the system's strategy for argument interpretation, which copes with the difficulty that word order i...
ICANN
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. In this paper we elaborate on a kernel extension to tensorbased data analysis. The proposed ideas find applications in supervised learning problems where input data have ...
JGT
2010
13 years 8 months ago
2010
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...