1806 search results - page 9 / 362 » Some Functions Computable with a Fused-Mac |
EUROGP
2003
Springer
14 years 1 months ago
2003
Springer
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...
ENTCS
2002
13 years 8 months ago
2002
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
ARITH
2001
IEEE
14 years 6 days ago
2001
IEEE
We give the results of our search for the worst cases for correct rounding of the major elementary functions in double precision floating-point arithmetic. These results allow the...
LATIN
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
COCO
2005
Springer
14 years 2 months ago
2005
Springer
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...