1806 search results - page 91 / 362 » Some Functions Computable with a Fused-Mac |
139
click to vote
UC
2009
Springer
16 years 15 days ago
2009
Springer
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
149
click to vote
ICFP
1999
ACM
15 years 10 months ago
1999
ACM
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
174
click to vote
CTRSA
2009
Springer
16 years 22 days ago
2009
Springer
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...
157
click to vote
DAGM
2003
Springer
15 years 11 months ago
2003
Springer
Compared to their ancestors in the early 1970s, present day computer games are of incredible complexity and show magnificent graphical performance. However, in programming intelli...
195
click to vote
SIAMCOMP
1998
15 years 5 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...