Three different schedules for launching kernels in a hash join between tables R and S.</p
Arbeit an der Bibliothek noch nicht eingelangt - Daten nicht geprüftAbweichender Titel nach Übersetz...
Individual component and the Doylestown algorithm at different time-points before HCC recurrence.</p
Trying to attack the problem of resource contention, created by multiple parallel applications runni...
Two different ways to schedule two CUDA kernels, each of which is in a CUDA stream.</p
Percentage of execution time of two table hash join with sequential execution, MultiQx-GPU Optimizat...
<p>Scheduling result using machine sharing algorithm (assuming there are three sets of mining fleets...
Speedup of two-table hash join GPU operations that MultiQx-GPU Optimization and Two-stage Model over...
In database systems most join algorithms are binary and will only operate on two inputs at a time. ...
Two contingency tables for co-occurrence of two TFs on CTS-DHSs (top) and on ubiq-DHSs (bottom).</p
<p>The execution time of the three methods against different numbers of new data points.</p
One of the major problems of temporal databases is to develop efficient algorithms for operations th...
<p>Running times of GASOLINE and SMETANA for different number of nodes () of the ancestor network.</...
http://deepblue.lib.umich.edu/bitstream/2027.42/3488/5/bam7743.0001.001.pdfhttp://deepblue.lib.umich...
Distribution of clients linked within ZHCT by month and time it took to complete linkage.</p
Virtual schedule of multi-project after eliminating the second conflict at time slot 8.</p
Arbeit an der Bibliothek noch nicht eingelangt - Daten nicht geprüftAbweichender Titel nach Übersetz...
Individual component and the Doylestown algorithm at different time-points before HCC recurrence.</p
Trying to attack the problem of resource contention, created by multiple parallel applications runni...
Two different ways to schedule two CUDA kernels, each of which is in a CUDA stream.</p
Percentage of execution time of two table hash join with sequential execution, MultiQx-GPU Optimizat...
<p>Scheduling result using machine sharing algorithm (assuming there are three sets of mining fleets...
Speedup of two-table hash join GPU operations that MultiQx-GPU Optimization and Two-stage Model over...
In database systems most join algorithms are binary and will only operate on two inputs at a time. ...
Two contingency tables for co-occurrence of two TFs on CTS-DHSs (top) and on ubiq-DHSs (bottom).</p
<p>The execution time of the three methods against different numbers of new data points.</p
One of the major problems of temporal databases is to develop efficient algorithms for operations th...
<p>Running times of GASOLINE and SMETANA for different number of nodes () of the ancestor network.</...
http://deepblue.lib.umich.edu/bitstream/2027.42/3488/5/bam7743.0001.001.pdfhttp://deepblue.lib.umich...
Distribution of clients linked within ZHCT by month and time it took to complete linkage.</p
Virtual schedule of multi-project after eliminating the second conflict at time slot 8.</p
Arbeit an der Bibliothek noch nicht eingelangt - Daten nicht geprüftAbweichender Titel nach Übersetz...
Individual component and the Doylestown algorithm at different time-points before HCC recurrence.</p
Trying to attack the problem of resource contention, created by multiple parallel applications runni...
DOI
Add to ORKG