794 search results - page 70 / 159 » Challenges in Parallel Graph Processing |
BIBM
2009
IEEE
14 years 3 months ago
2009
IEEE
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
EDBT
2012
ACM
11 years 11 months ago
2012
ACM
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
SIGMOD
2010
ACM
14 years 29 days ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
PVM
1997
Springer
14 years 1 months ago
1997
Springer
The traditional approach to the parallelization of linear algebra algorithms such as matrix multiplication and LU factorization calls for static allocation of matrix blocks to proc...
SEUS
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract. Describing parallel hardware and software is difficult, especially in an embedded setting. Five years ago, we started the shim project to address this challenge by develo...