Sciweavers

583 search results - page 6 / 117
» On small blocking sets and their linearity
Sort
View
MICRO
2010
IEEE
238views Hardware» more  MICRO 2010»
13 years 5 months ago
Sampling Dead Block Prediction for Last-Level Caches
Last-level caches (LLCs) are large structures with significant power requirements. They can be quite inefficient. On average, a cache block in a 2MB LRU-managed LLC is dead 86% of ...
Samira Manabi Khan, Yingying Tian, Daniel A. Jimen...
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 7 months ago
Signal Set Design for Full-Diversity Low-Decoding-Complexity Differential Scaled-Unitary STBCs
— The problem of designing high rate, full diversity noncoherent space-time block codes (STBCs) with low encoding and decoding complexity is addressed. First, the notion of g-gro...
G. Susinder Rajan, B. Sundar Rajan
DCC
2008
IEEE
14 years 7 months ago
Coprimitive sets and inextendable codes
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
T. L. Alderson, Aiden A. Bruen
DM
2006
128views more  DM 2006»
13 years 7 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
PPSC
1989
13 years 8 months ago
Evaluating Block Algorithm Variants in LAPACK
The LAPACK software project currently under development is intended to provide a portable linear algebra library for high performance computers. LAPACK will make use of the Level 1...
Ed Anderson, Jack Dongarra