486 search results - page 18 / 98 » Parallel Algorithms for Relational Coarsest Partition Proble... |
121
Voted
IPPS
2002
IEEE
15 years 6 months ago
2002
IEEE
Multiple memory module architecture enjoys higher memory access bandwidth and thus higher performance. Two key problems in gaining high performance in this kind of architecture ar...
123
Voted
JPDC
2007
15 years 1 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 ...
112
Voted
HIPC
2005
Springer
15 years 7 months ago
2005
Springer
We examine the problem of scheduling concurrent independent flows on multiple-disk I/O storage systems. Two models are considered: in the shared buffer model the memory buffer is ...
134
Voted
CIKM
2005
Springer
15 years 7 months ago
2005
Springer
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
137
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...