2941 search results - page 137 / 589 » The Myth of the Educational Computer |
133
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...
119
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
131
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
136
click to vote
SIGCSE
2008
ACM
15 years 4 months ago
2008
ACM
Providing consistent, instant, and detailed feedback to students has been a big challenge in teaching Web based computing, given the complexity of project assignments and the comp...