Sciweavers

140 search results - page 20 / 28
» Some new results for optimal ternary linear codes
Sort
View
TIT
2010
110views Education» more  TIT 2010»
13 years 2 months ago
Error rates of the maximum-likelihood detector for arbitrary constellations: convex/concave behavior and applications
Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity properties of error rates of the maximum likelihood detector operating in the AWGN ch...
Sergey Loyka, Victoria Kostina, François Ga...
CASES
2003
ACM
14 years 18 days ago
Exploiting bank locality in multi-bank memories
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...
Guilin Chen, Mahmut T. Kandemir, Hendra Saputra, M...
ASPLOS
1996
ACM
13 years 11 months ago
A Quantitative Analysis of Loop Nest Locality
This paper analyzes and quantifies the locality characteristics of numerical loop nests in order to suggest future directions for architecture and software cache optimizations. Si...
Kathryn S. McKinley, Olivier Temam
BMCBI
2010
132views more  BMCBI 2010»
13 years 7 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
ICCS
2005
Springer
14 years 26 days ago
Fast Expression Templates
Abstract. Expression templates (ET) can significantly reduce the implementation effort of mathematical software. For some compilers, especially for those of supercomputers, it ca...
Jochen Härdtlein, Alexander Linke, Christoph ...