413 search results - page 3 / 83 » Are Hopfield Networks Faster than Conventional Computers |
WABI
2005
Springer
13 years 11 months ago
2005
Springer
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
ICNP
2007
IEEE
14 years 2 days ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
IJBC
2007
13 years 5 months ago
2007
In this tutorial, we present optimal Cellular Nonlinear Network (CNN) templates for implementing linearly-separable one-dimensional (1-D) Cellular Automata (CA). From the gallery ...
CLEIEJ
2004
13 years 5 months ago
2004
Small computing devices are everywhere changing the way people communicate and interact, however applications for these devices are developed more or less with the same tools used...
ICNP
2005
IEEE
13 years 11 months ago
2005
IEEE
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...