19866 search results - page 360 / 3974 » Computing all factorizations in *** |
178
click to vote
TPDS
2010
15 years 5 months ago
2010
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
181
click to vote
ASAP
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper explores an architecture for parallel independent computations of inner products over the direct product ring . The structure is based on the polynomial mapping of the ...
175
click to vote
PKC
2010
Springer
15 years 10 months ago
2010
Springer
Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restric...
165
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Virtual Computer Corporation has combined the latest reconfigurable component technology with a number of advanced software tools in one easy to use `system approach' to digi...
177
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...