430 search results - page 16 / 86 » An Efficient Parallel Join Algorithm Based On Hypercube-Part... |
178
click to vote
CP
2009
Springer
16 years 10 days ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
VLDB
1994
ACM
15 years 3 months ago
1994
ACM
This paper presents an innovative partitionbased time join strategy for temporal databases where time is represented by time intervals. The proposed method maps time intervals to ...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Huge energy consumption has become a critical bottleneck for further applying large-scale cluster systems to build new data centers. Among various components of a data center, sto...
103
click to vote
BMCBI
2010
14 years 11 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
116
click to vote
MSO
2003
15 years 1 months ago
2003
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...