Sciweavers

3913 search results - page 133 / 783
» complexity 2006
Sort
View
IJON
2002
130views more  IJON 2002»
13 years 10 months ago
Error-backpropagation in temporally encoded networks of spiking neurons
For a network of spiking neurons that encodes information in the timing of individual spike times, we derive a supervised learning rule, SpikeProp, akin to traditional errorbackpr...
Sander M. Bohte, Joost N. Kok, Johannes A. La Pout...
PRL
2002
69views more  PRL 2002»
13 years 10 months ago
Variant code transformations for linear quadtrees
In this paper, general guidelines and specific algorithms for code transformations between breadth-first (BF) and depth-first (DF) linear quadtrees are proposed. Each algorithm ha...
Pei-Min Chen
IRI
2006
IEEE
14 years 4 months ago
Environment as support for simplification, reuse and integration of processes in spatial MAS
The development of solutions to complex problems requires finding answers to several questions which are obstacles on the road leading to the solution. To perpetuate progress, the...
Denis Payet, Rémy Courdier, Nicolas S&eacut...
IPM
2006
94views more  IPM 2006»
13 years 10 months ago
Binary Pathfinder: An improvement to the Pathfinder algorithm
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
Vicente P. Guerrero Bote, Felipe Zapico-Alonso, Ma...
IPL
2006
103views more  IPL 2006»
13 years 10 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen