2214 search results - page 19 / 443 » complexity 2004 |
WIA
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
ASAP
2004
IEEE
13 years 11 months ago
2004
IEEE
We propose a radix-r digit-recurrence algorithm for complex square-root. The operand is prescaled to allow the selection of square-root digits by rounding of the residual. This lea...
DIAL
2004
IEEE
13 years 11 months ago
2004
IEEE
A new text line location and separation algorithm for complex handwritten documents is proposed. The algorithm is based on the application of a fuzzy directional runlength. The pr...
ANTS
2004
Springer
14 years 28 days ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
WSC
2004
13 years 9 months ago
2004
Distributed simulation promises a range of benefits and opportunities, especially for modeling large-scale complex systems, such as wafer fabs. However, as with many promising tec...