10608 search results - page 697 / 2122 » Complexity of O'Hara's Algorithm |
198
click to vote
TIFS
2010
15 years 2 months ago
2010
Quantitative steganalysis strives to estimate the change rate defined as the relative number of embedding changes introduced by steganography. In this paper, we propose two new cla...
227
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
Spoken dialogue systems are gaining popularity with improvements in speech recognition technologies. Dialogue systems can be modeled effectively using POMDPs, achieving improvemen...
190
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
The problem of estimation of the slowly-varying instantaneous frequency of a nonstationary complex sinusoidal signal buried in noise is considered. This problem is usually solved ...
237
click to vote
ISCAS
2011
IEEE
14 years 11 months ago
2011
IEEE
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...
243
click to vote
FOGA
2011
14 years 11 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...