987 search results - page 148 / 198 » Asynchronous parallel search by the parallel genetic algorit... |
CDES
2008
13 years 10 months ago
2008
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
BMCBI
2011
13 years 21 days ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
CLUSTER
2008
IEEE
14 years 3 months ago
2008
IEEE
—We consider the problem of efficiently managing massive data in a large-scale distributed environment. We consider data strings of size in the order of Terabytes, shared and ac...
IPPS
2003
IEEE
14 years 2 months ago
2003
IEEE
In this paper we use a mathematical approach to automatically generate high performance short vector code for the discrete Fourier transform (DFT). We represent the well-known Coo...
IPPS
1999
IEEE
14 years 1 months ago
1999
IEEE
Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which...