27 search results - page 2 / 6 » Fast Parallel Computation of the Polynomial Shift |
ANCS
2006
ACM
13 years 10 months ago
2006
ACM
Clos networks are an important class of switching networks due to their modular structure and much lower cost compared with crossbars. For routing I/O permutations of Clos network...
EDBT
2011
ACM
12 years 8 months ago
2011
ACM
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
BMCBI
2004
13 years 4 months ago
2004
Background: Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results: Herein, a parallel version of the multi-alignment program...
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The socalled Polynomial Modular Number System (PMNS) allows for fast polyn...
EUROPAR
2010
Springer
13 years 5 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...