Sciweavers

903 search results - page 34 / 181
» Completeness Results for Memory Logics
Sort
View
CONNECTION
2006
101views more  CONNECTION 2006»
13 years 8 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
ISCA
2000
IEEE
63views Hardware» more  ISCA 2000»
14 years 1 months ago
An embedded DRAM architecture for large-scale spatial-lattice computations
Spatial-lattice computations with finite-range interactions are an important class of easily parallelized computations. This class includes many simple and direct algorithms for ...
Norman Margolus
NN
2011
Springer
348views Neural Networks» more  NN 2011»
13 years 3 months ago
Tree-like hierarchical associative memory structures
In this letter we explore an alternative structural representation for Steinbuch-type binary associative memories. These networks offer very generous storage capacities (both asy...
João Sacramento, Andreas Wichert
VLDB
1997
ACM
104views Database» more  VLDB 1997»
14 years 25 days ago
Integrating Reliable Memory in Databases
Abstract. Recent results in the Rio project at the University of Michigan show that it is possible to create an area of main memory that is as safe as disk from operating system cr...
Wee Teck Ng, Peter M. Chen
ASPDAC
2004
ACM
118views Hardware» more  ASPDAC 2004»
14 years 2 months ago
Minimization of memory size for heterogeneous MDDs
Abstract— In this paper, we propose exact and heuristic algorithms for minimizing the memory size for heterogeneous Multivalued Decision Diagrams (MDDs). In a heterogeneous MDD, ...
Shinobu Nagayama, Tsutomu Sasao