3049 search results - page 300 / 610 » On the Convergence of Bound Optimization Algorithms |
177
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
A unified framework is applied to solving various sequence comparison problems for run-length encoded strings. All of these algorithms take O(min{mn , m n}) time and O(max{m, n}) s...
151
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
166
click to vote
CAGD
2008
15 years 6 months ago
2008
In this paper a method is presented to fair the limit surface of a subdivision algorithm locally around an extraordinary point. The dominant six eigenvalues of the subdivision mat...
158
click to vote
ANOR
2011
15 years 1 months ago
2011
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
185
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...