724 search results - page 11 / 145 » Some Structural Complexity Aspects of Neural Computation |
SAGT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Here is proposed a review of the different choices to structure spike trains, using deterministic metrics. Temporal constraints observed in biological or computational spike train...
IJCAI
1993
13 years 9 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
CAISE
2006
Springer
13 years 11 months ago
2006
Springer
The organization of objects into classes and categories is an essential task in the process of forming concepts. Within computer science, this classification activity must be suppo...