661 search results - page 26 / 133 » Argument Reduction by Factoring |
SAS
1999
Springer
15 years 1 months ago
1999
Springer
The intrinsic complexity of most protocol speci cations in particular, and of asynchronous systems in general, lead us to study combinations of static analysis with classical model...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
IBMRD
2006
14 years 9 months ago
2006
Because they are based on large content-addressable memories, load-store queues (LSQ) present implementation challenges in superscalar processors, especially as issue width and nu...
SPEECH
1998
14 years 9 months ago
1998
We consider the problem of obtaining a reduced dimension representation of electropalatographic (EPG) data. An unsupervised learning approach based on latent variable modelling is...
LATINCRYPT
2010
14 years 8 months ago
2010
We describe an FPGA accelerator for the Kannan–Fincke– Pohst enumeration algorithm (KFP) solving the Shortest Lattice Vector Problem (SVP). This is the first FPGA implementati...