10988 search results - page 53 / 2198 » Algorithmic Folding Complexity |
SODA
2008
ACM
13 years 10 months ago
2008
ACM
SODA
1992
ACM
13 years 10 months ago
1992
ACM
STACS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Constructive Induction is the process of transforming the original representation of hard concepts with complex interaction into a representation that highlights regularities. Mos...
ARITH
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper describes the application of high radix redundant CORDIC algorithms to complex logarithmic number system arithmetic. It shows that a CLNS addition can be performed with...