37 search results - page 6 / 8 » A Low Communication Sort Algorithm for a Parallel Database M... |
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
VLDB
1994
ACM
13 years 11 months ago
1994
ACM
The performance of data-parallel algorithms for spatial operations using data-parallel variants of the bucket PMR quadtree, R-tree, and R+-tree spatial data structures is compared...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
JPDC
2007
13 years 7 months ago
2007
In this paper, we address the problem of multiple sequence alignment (MSA) for handling very large number of proteins sequences on mesh-based multiprocessor architectures. As the ...
IJDAR
2010
13 years 6 months ago
2010
The set of references that typically appear toward the end of journal articles is sometimes, though not always, a field in bibliographic (citation) databases. But even if referenc...