995 search results - page 15 / 199 » complexity 2011 |
128
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
This paper presents an efficient method to compute the maximum likelihood (ML) estimation of the parameters of a complex 2-D sinusoidal, with the complexity order of the FFT. The...
117
click to vote
DCC
2011
IEEE
14 years 6 months ago
2011
IEEE
Abstract Many attacks on encryption schemes rely on statistical considerations using plaintext/ciphertext pairs to find some information on the key. We provide here simple formula...
108
click to vote
ECCC
2011
14 years 6 months ago
2011
An input-oblivious proof system is a proof system in which the proof does not depend on the claim being proved. Input-oblivious versions of NP and MA were introduced in passing by...
173
click to vote
COCOA
2011
Springer
13 years 11 months ago
2011
Springer
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economi...
129
click to vote
FOGA
2011
14 years 3 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...