724 search results - page 17 / 145 » Some Structural Complexity Aspects of Neural Computation |
MOC
1998
13 years 7 months ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
SBRN
2000
IEEE
14 years 2 days ago
2000
IEEE
This paper explores basic aspects of the immune system and proposes a novel immune network model with the main goals of clustering and filtering unlabeled numerical data sets. It ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...