2957 search results - page 315 / 592 » The Complexity of Polynomial-Time Approximation |
171
click to vote
ICC
2007
IEEE
16 years 29 days ago
2007
IEEE
Abstract—In this paper we propose a low complexity frequency domain channel estimator for pilot-symbol-assisted (PSA) orthogonal frequency division multiplexing (OFDM) systems in...
163
click to vote
IJCNN
2007
IEEE
16 years 28 days ago
2007
IEEE
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
171
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
150
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ...
152
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Equalization techniques for room impulse responses (RIRs) are important in acoustic signal processing applications such as speech dereverberation. In practice, only approximate es...