8695 search results - page 121 / 1739 » Making the Complex Simple |
151
click to vote
ATAL
2004
Springer
15 years 11 months ago
2004
Springer
We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given...
162
click to vote
WIA
2004
Springer
15 years 11 months 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...
138
click to vote
ASAP
2004
IEEE
15 years 10 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...
167
click to vote
ACL
2010
15 years 4 months ago
2010
Hierarchical HMM (HHMM) parsers make promising cognitive models: while they use a bounded model of working memory and pursue incremental hypotheses in parallel, they still achieve...
150
click to vote
ISORC
2008
IEEE
16 years 20 days ago
2008
IEEE
The specific constraints that must be satisfied by embedded systems, such as timeliness, energy efficiency of battery-operated devices, dependable operation in safety-relevant sce...