861 search results - page 59 / 173 » Faster integer multiplication |
146
click to vote
ITCC
2005
IEEE
15 years 7 months ago
2005
IEEE
We define here the Montgomery Exponent of order s, modulo the odd integer N, by MEXP = MEXP(A, X, N, s) = AX 2−s(X−1) (mod N), and illustrate some properties and usage of thi...
132
Voted
MP
2002
15 years 1 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
114
click to vote
MVA
2007
15 years 3 months ago
2007
In this paper we present a stochastic sampling approach to estimate multiple human trajectory in the meeting. The algorithm is formalized as a energy minimization problem based on...
124
click to vote
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
—In this paper, we formulate an optimization problem for the design of light-tree based logical topology in Wavelength Division Multiplexing (WDM) networks. The problem is compri...
AES
2000
Springer
15 years 6 months ago
2000
Springer
We compare the five candidates for the Advanced Encryption Standard based on their performance on the Alpha 21264, a 64-bit superscalar processor. There are several new features o...