575 search results - page 15 / 115 » Computing Maximum Subsequence in Parallel |
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
Communication overhead is one of the most important factors affecting the performance of message passing multicomputers. We present evidence (through the analysis of several paral...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
Torus/mesh-based machines have received increasing attention. It is natural to identify the maximum healthy submeshes in a faulty torus/mesh so as to lower potential performance d...
CHES
2004
Springer
14 years 28 days ago
2004
Springer
In the current work we propose a pipelining scheme for implementing Elliptic Curve Cryptosystems (ECC). The scalar multiplication is the dominant operation in ECC. It is computed b...
SPAA
2010
ACM
14 years 10 days ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
IEEESCC
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...