Sciweavers

229 search results - page 7 / 46
» How Efficient Can Memory Checking Be
Sort
View
DFT
2004
IEEE
94views VLSI» more  DFT 2004»
13 years 11 months ago
Response Compaction for Test Time and Test Pins Reduction Based on Advanced Convolutional Codes
This paper addresses the problem of test response compaction. In order to maximize compaction ratio, a single-output encoder based on check matrix of a (n, n1, m, 3) convolutional...
Yinhe Han, Yu Hu, Huawei Li, Xiaowei Li, Anshuman ...
IPPS
1996
IEEE
13 years 11 months ago
How to Optimize Residual Communications?
Minimizing communications when mapping affine loop nests onto distributed memory parallel computers has already drawn a lot of attention. This paper focuses on the next step: as i...
Michèle Dion, Cyril Randriamaro, Yves Rober...
DAC
2004
ACM
14 years 8 months ago
An efficient scalable and flexible data transfer architecture for multiprocessor SoC with massive distributed memory
Massive data transfer encountered in emerging multimedia embedded applications requires architecture allowing both highly distributed memory structure and multiprocessor computati...
Sang-Il Han, Amer Baghdadi, Marius Bonaciu, Soo-Ik...
ECCV
2006
Springer
14 years 9 months ago
Fast Memory-Efficient Generalized Belief Propagation
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...
M. Pawan Kumar, Philip H. S. Torr
BIOINFORMATICS
2006
130views more  BIOINFORMATICS 2006»
13 years 7 months ago
Memory efficient folding algorithms for circular RNA secondary structures
A small class of RNA molecules, in particular the tiny genomes of viroids, are circular. Yet most structure prediction algorithms handle only linear RNAs. The most straightforward ...
Ivo L. Hofacker, Peter F. Stadler