29908 search results - page 245 / 5982 » On the Complexity of |
175
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...
154
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...
166
click to vote
ICASSP
2010
IEEE
15 years 6 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...
187
click to vote
ICANN
2010
Springer
15 years 6 months ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
188
Voted
AHS
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper introduces Perplexus, a European project that aims to develop a scalable hardware platform made of custom reconfigurable devices endowed with bio-inspired capabilities...