Sciweavers

3616 search results - page 160 / 724
» Conditional Memory Ordering
Sort
View
ORDER
2000
85views more  ORDER 2000»
15 years 6 months ago
Epimorphisms in Certain Varieties of Algebras
We prove a lemma which, under restrictive conditions, shows that epimorphisms in V are surjective if this is true for epimorphisms from irreducible members of V . This lemma is app...
Gunter Bruns, John Harding
271
Voted
LCTRTS
2005
Springer
15 years 11 months ago
Generation of permutations for SIMD processors
Short vector (SIMD) instructions are useful in signal processing, multimedia, and scientific applications. They offer higher performance, lower energy consumption, and better res...
Alexei Kudriavtsev, Peter M. Kogge
VLSID
1996
IEEE
132views VLSI» more  VLSID 1996»
15 years 10 months ago
A study of composition schemes for mixed apply/compose based construction of ROBDDs
Reduced Ordered Binary Decision Diagrams ROBDDs have traditionally been built in a bottom-up fashion. In this scheme, the intermediate peak memory utilization is often larger than...
Amit Narayan, Sunil P. Khatri, Jawahar Jain, Masah...
166
Voted
IACR
2011
209views more  IACR 2011»
14 years 5 months ago
Improved Attacks on Full GOST
GOST is a well known block cipher which was developed in the Soviet Union during the 1970’s as an alternative to the US-developed DES. In spite of considerable cryptanalytic eff...
Itai Dinur, Orr Dunkelman, Adi Shamir
WWW
2003
ACM
16 years 6 months ago
Scalable techniques for memory-efficient CDN simulations
Since CDN simulations are known to be highly memory-intensive, in this paper, we argue the need for reducing the memory requirements of such simulations. We propose a novel memory...
Purushottam Kulkarni, Prashant J. Shenoy, Weibo Go...