3134 search results - page 58 / 627 » Computing full disjunctions |
WAIFI
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. Miller’s algorithm for computing pairings involves performing multiplications between elements that belong to different finite fields. Namely, elements in the full e...
IPPS
1996
IEEE
14 years 2 months ago
1996
IEEE
The growing disparity between processor and memory speeds has caused memory bandwidth to become the performance bottleneck for many applications. In particular, this performance g...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We present Risk Integrated's Enterprise Spreadsheet Platform (ESP), a technical approach to the near-elimination of spreadsheet risk in the enterprise computing environment, ...
IJCNN
2006
IEEE
14 years 4 months ago
2006
IEEE
—In this paper, we present three different methods for implementing the Probabilistic Neural Network on a Beowulf cluster computer. The three methods, Parallel Full Training Set ...
AIPS
2004
13 years 11 months ago
2004
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...