14699 search results - page 416 / 2940 » Complexity and Cognitive Computing |
141
click to vote
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
Most speech enhancement algorithms heavily depend on the noise power spectral density (PSD). Because this quantity is unknown in practice, estimation from the noisy data is necess...
150
click to vote
AUTOMATICA
2008
15 years 5 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
166
click to vote
CC
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
133
click to vote
IPL
2006
15 years 5 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
114
click to vote
TSP
2008
15 years 5 months ago
2008
In this paper, we address the joint data-aided estimation of frequency offsets and channel coefficients in uplink MIMO-OFDMA systems. As the Maximum Likelihood (ML) estimator is i...