653 search results - page 70 / 131 » The size of minimum 3-trees |
136
click to vote
CIKM
1999
Springer
15 years 10 months ago
1999
Springer
The join relational operation is one of the most expensive among database operations. In this study, we consider the problem of scheduling page accesses in join processing. This r...
143
click to vote
ICCAD
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper presents two new algorithms, Redundant Vector Elimination(RVE) and Essential Fault Reduction (EFR), for generating compact test sets for combinational circuits under th...
143
click to vote
ISLPED
1997
ACM
15 years 10 months ago
1997
ACM
In this paper1 we propose a novel approach to synthesis for low power under tight timing constraints. Starting from a mapped netlist, we apply a powerful generalized matching algo...
190
click to vote
ICDCS
1993
IEEE
15 years 10 months ago
1993
IEEE
A network subsystem supporting a continuous media file system must guarantee a minimum throughput, a maximum delay, and a maximum jitter. We present a transport protocol that pro...
148
click to vote
HPDC
1994
IEEE
15 years 10 months ago
1994
IEEE
Partitioning data parallel computations across a network of heterogeneous workstations is a dificult problem for the user: We have developed a runtime partitioning methodfor choos...