10106 search results - page 1698 / 2022 » Algorithm Selection and Scheduling |
155
click to vote
PODS
1999
ACM
15 years 11 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
163
click to vote
ICNP
1999
IEEE
15 years 11 months ago
1999
IEEE
A number of QoS routing algorithms have been proposed to address the dual objective of selecting feasible paths through the network with enough resources to satisfy a connections&...
174
click to vote
CIKM
1999
Springer
15 years 11 months ago
1999
Springer
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
173
click to vote
CGO
2007
IEEE
15 years 10 months ago
2007
IEEE
Dynamic predication has been proposed to reduce the branch misprediction penalty due to hard-to-predict branch instructions. A recently proposed dynamic predication architecture, ...
166
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
Text summarization is a data reduction process. The use of text summarization enables users to reduce the amount of text that must be read while still assimilating the core inform...