Sciweavers

2479 search results - page 30 / 496
» A Computational Theory of Working Memory
Sort
View
SASN
2004
ACM
14 years 29 days ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim
WOMPAT
2001
Springer
13 years 12 months ago
A Study of Implicit Data Distribution Methods for OpenMP Using the SPEC Benchmarks
In contrast to the common belief that OpenMP requires data-parallel extensions to scale well on architectures with non-uniform memory access latency, recent work has shown that it ...
Dimitrios S. Nikolopoulos, Eduard Ayguadé
EGH
2011
Springer
12 years 7 months ago
Lossless Compression of Already Compressed Textures
Texture compression helps rendering by reducing the footprint in graphics memory, thus allowing for more textures, and by lowering the number of memory accesses between the graphi...
Jacob Ström, Per Wennersten
IJNSEC
2010
324views more  IJNSEC 2010»
13 years 2 months ago
Computing the Modular Inverse of a Polynomial Function over GF(2P) Using Bit Wise Operation
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
Rajaram Ramasamy, Amutha Prabakar Muniyandi
IPL
2008
82views more  IPL 2008»
13 years 7 months ago
Confusion of memory
It is a truism that for a machine to have a useful access to memory or workspace, it must "know" where its input ends and its working memory begins. Most machine models ...
Lawrence S. Moss