1171 search results - page 73 / 235 » Clustering for processing rate optimization |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
Execution plans produced by traditional query optimizers for data integration queries may yield poor performance for several reasons. The cost estimates may be inaccurate, the mem...
ICIP
2000
IEEE
14 years 14 days ago
2000
IEEE
Abstract—We describe a trellis-based algorithm which enables R-D optimum quantization decisions in the H.263+ video coding standard. The algorithm allows the quantization decisio...
CLUSTER
2001
IEEE
13 years 11 months ago
2001
IEEE
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
We introduce an optimum watermark embedding technique that satisfies common watermarking requirements such as visual fidelity, sufficient embedding rate, robustness against noise ...