2941 search results - page 138 / 589 » The Myth of the Educational Computer |
151
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
127
click to vote
CORR
2000
Springer
15 years 4 months ago
2000
Springer
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
135
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
122
click to vote
CORR
1998
Springer
15 years 4 months ago
1998
Springer
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a re...
137
click to vote
SIGCSE
2002
ACM
15 years 4 months ago
2002
ACM
As part of an NSF-funded IT Workforce grant, the authors conducted ethnographic research to provide deep understanding to the learning environment of computer science classrooms. ...