2585 search results - page 208 / 517 » computing 1999 |
106
click to vote
CHES
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. This paper describes the methodology and design of a scalable Montgomery multiplication module. There is no limitation on the maximum number of bits manipulated by the mu...
139
Voted
ARTS
1997
Springer
15 years 8 months ago
1997
Springer
We introduce a mathematical model of the timed behaviour of components with streams as input and output using a hierarchy of timing concepts. We distinguish non-timed streams, dis...
144
click to vote
FCT
1999
Springer
15 years 8 months ago
1999
Springer
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...
112
Voted
ARITH
1999
IEEE
15 years 8 months ago
1999
IEEE
A new IEEE compliant floating-point rounding algorithm for computing the rounded product from a carry-save representation of the product is presented. The new rounding algorithm i...