677 search results - page 80 / 136 » On the reconstruction of perfect codes |
LCPC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We have designed and implemented an interprocedural algorithm to analyze symbolic value ranges that can be assumed by variables at any given point in a program. Our algor...
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
If parallelism can be successfully exploited in a program, significant reductions in execution time can be achieved. However, if sections of the code are dominated by parallel ove...
VTS
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper presents a new technique for on-line consistency checking of embedded DRAMs. The basic idea is to use the periodic refresh operation for concurrently computing a test c...
ICS
1995
Tsinghua U.
15 years 1 months ago
1995
Tsinghua U.
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
103
click to vote
TIFS
2008
14 years 9 months ago
2008
This paper presents a security analysis for data hiding methods based on nested lattice codes, extending the analysis provided by previous works to a more general scenario. The se...