Sciweavers

1270 search results - page 233 / 254
» Improving Code Density Using Compression Techniques
Sort
View
ECCC
1998
105views more  ECCC 1998»
13 years 8 months ago
Pseudorandom generators without the XOR Lemma
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
Madhu Sudan, Luca Trevisan, Salil P. Vadhan
INTEGRATION
2006
82views more  INTEGRATION 2006»
13 years 8 months ago
On whitespace and stability in physical synthesis
In the context of physical synthesis, large-scale standard-cell placement algorithms must facilitate incremental changes to layout, both local and global. In particular, flexible ...
Saurabh N. Adya, Igor L. Markov, Paul G. Villarrub...
WMPI
2004
ACM
14 years 2 months ago
The Opie compiler from row-major source to Morton-ordered matrices
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Steven T. Gabriel, David S. Wise
EJASP
2010
166views more  EJASP 2010»
13 years 3 months ago
Decoding Schemes for FBMC with Single-Delay STTC
Orthogonally multiplexed Quadrature Amplitude Modulation (O-QAM) with Filter Banks based Multi Carrier modulation (FBMC) is a multi-carrier modulation scheme that can be considere...
Chrislin Lélé, Didier Le Ruyet
SAS
2009
Springer
149views Formal Methods» more  SAS 2009»
14 years 3 months ago
Creating Transformations for Matrix Obfuscation
There are many programming situations where it would be convenient to conceal the meaning of code, or the meaning of certain variables. This can be achieved through program transfo...
Stephen Drape, Irina Voiculescu