42230 search results - page 399 / 8446 » Algorithms and Complexity Results for |
171
Voted
ICASSP
2010
IEEE
15 years 7 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...
190
Voted
ACL
1994
15 years 8 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
192
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
174
click to vote
SPAA
2003
ACM
16 years 2 days ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
208
Voted
SODA
2000
ACM
15 years 8 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...