1026 search results - page 137 / 206 » On Finding Minimal w-cutset |
179
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
174
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
Clock skew scheduling is a technique that intentionally introduces skews to memory elements to improve the performance of a sequential circuit. It was shown in [21] that the full ...
157
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
152
click to vote
SAT
2010
Springer
15 years 10 months ago
2010
Springer
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
153
click to vote
IBPRIA
2007
Springer
15 years 10 months ago
2007
Springer
Shape elongation is one of the basic shape descriptors that has a very clear intuitive meaning. That is reason for its applicability in many shape classification tasks. In this pap...