29908 search results - page 364 / 5982 » On the complexity of communication complexity |
191
click to vote
UAI
2000
15 years 8 months ago
2000
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
180
click to vote
VVEIS
2007
15 years 8 months ago
2007
Research in web services has allowed reusable, distributed, loosely coupled components which can easily be composed to build systems or to produce more complex services. Compositio...
178
click to vote
DLT
2008
15 years 7 months ago
2008
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change di...
157
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
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...