680 search results - page 39 / 136 » Computational Complexity and Anytime Algorithm for Inconsist... |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper, we extend our previous study on discriminative training using non-uniform criteria for speech recognition. The work will put emphasis on how the acoustic modeling i...
TASLP
2010
13 years 2 months ago
2010
We present a frequency-domain technique based on PARAllel FACtor (PARAFAC) analysis that performs multichannel blind source separation (BSS) of convolutive speech mixtures. PARAFAC...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
EMSOFT
2007
Springer
14 years 2 months ago
2007
Springer
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...