6939 search results - page 294 / 1388 » Algorithm Engineering for Parallel Computation |
110
click to vote
APPINF
2003
15 years 4 months ago
2003
We develop a memory-efficient off-line algorithm for the enumeration of global states of a distributed computation. The algorithm allows the parameterization of its memory requir...
136
click to vote
ICPADS
2000
IEEE
15 years 7 months ago
2000
IEEE
The most costly spatial operation in spatial databases is a spatial join with combines objects from two data sets based on spatial predicates. Even if the execution time of sequen...
160
click to vote
WEA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
125
click to vote
EUSFLAT
2009
15 years 28 days ago
2009
-- An approach to estimate the number of rules by spectral analysis of the training dataset has been recently proposed [1]. This work presents an analysis of such a method in high ...
121
click to vote
ICPPW
2006
IEEE
15 years 9 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...