4911 search results - page 738 / 983 » Tree dependence analysis |
143
Voted
CCO
2001
Springer
15 years 8 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
161
Voted
EDBT
2000
ACM
15 years 8 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
148
Voted
PG
1999
IEEE
15 years 8 months ago
1999
IEEE
Using object clusters for hierarchical radiosity greatly improves the efficiency and thus usability of radiosity computations. By eliminating the quadratic starting phase very lar...
121
Voted
ICNP
1998
IEEE
15 years 7 months ago
1998
IEEE
We present chaining techniques for signing/verifying multiple packets using a single signing/verification operation. We then present flow signing and verification procedures based...
161
Voted
STACS
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...