382 search results - page 21 / 77 » Grid computing for parallel bioinspired algorithms |
132
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...
100
click to vote
SC
1995
ACM
15 years 6 months ago
1995
ACM
A parallel time-dependent incompressible flow solver and a parallel multigrid elliptic kernel are described. The flow solver is based on a second-order projection method applied...
120
Voted
HPCC
2007
Springer
15 years 8 months ago
2007
Springer
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
PDCAT
2004
Springer
15 years 7 months ago
2004
Springer
Today’s cryptanalysis on symmetric key cryptography is encouraging the use of larger key sizes and complex algorithms to achieve an unbreakable state. However, this leads an inc...
141
click to vote
GRID
2006
Springer
15 years 2 months ago
2006
Springer
One of the first motivations of using grids comes from applications managing large data sets in field such as high energy physics or life sciences. To improve the global throughput...