10608 search results - page 273 / 2122 » Complexity of O'Hara's Algorithm |
86
Voted
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
113
click to vote
ISCAS
2005
IEEE
15 years 6 months ago
2005
IEEE
—This paper proposes a new algorithm for H.264 rate control, and aims at improving coding quality of high motion scenes. Firstly, the motion estimations using all the possible mo...
105
Voted
ICAISC
2010
Springer
15 years 5 months ago
2010
Springer
In the paper a new evolutionary algorithm for induction of univariate regression trees is proposed. In contrast to typical top-down approaches it globally searches for the best tre...
100
click to vote
ISSAC
1998
Springer
15 years 4 months ago
1998
Springer
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
84
Voted
DAC
1996
ACM
15 years 4 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...