363 search results - page 34 / 73 » Code Generation for Polynomial Multiplication |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Network coding increases throughput and is robust against failures and erasures. However, since it allows mixing of information within the network, a single corrupted packet genera...
HT
1999
ACM
13 years 12 months ago
1999
ACM
Making hypermedia adaptable for multiple forms of presentation involves enabling multiple distinct specifications for how a given collection of hypermedia can have its presentatio...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
PASTE
2010
ACM
14 years 21 days ago
2010
ACM
We present a novel technique that identifies the source compiler of program binaries, an important element of program provenance. Program provenance answers fundamental questions...
CC
2006
Springer
13 years 11 months ago
2006
Springer
Commonly-used memory units enable a processor to load and store multiple registers in one instruction. We showed in 2003 how to extend gcc with a stack-location-allocation (SLA) ph...