Sciweavers

652 search results - page 49 / 131
» Linear Explicit Substitutions
Sort
View
AML
2005
84views more  AML 2005»
13 years 8 months ago
Modularity of proof-nets
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
Roberto Maieli, Quintijn Puite
ICASSP
2008
IEEE
14 years 3 months ago
Blind maximum-likelihood data recovery in OFDM
OFDM modulation combines the advantages of high achievable rates and relatively easy implementation. In this paper, we show how to perform blind maximum-likelihood data recovery i...
T. Y. Al-Naffouri, Ahmed Abdul Quadeer
EUROCRYPT
2007
Springer
14 years 3 months ago
Mesh Signatures
sion of an extended abstract to be published in Advances in Cryptology—EUROCRYPT 2007, Springer-Verlag, 2007. Available online from the IACR Cryptology ePrint Archive as Report 2...
Xavier Boyen
CGO
2005
IEEE
14 years 2 months ago
A Progressive Register Allocator for Irregular Architectures
Register allocation is one of the most important optimizations a compiler performs. Conventional graphcoloring based register allocators are fast and do well on regular, RISC-like...
David Koes, Seth Copen Goldstein
CTRSA
2003
Springer
96views Cryptology» more  CTRSA 2003»
14 years 2 months ago
Hardware Performance Characterization of Block Cipher Structures
In this paper, we present a general framework for evaluating the performance characteristics of block cipher structures composed of S-boxes and Maximum Distance Separable (MDS) ma...
Lu Xiao, Howard M. Heys