Sciweavers

127 search results - page 1 / 26
» Call by Need Computations to Root-Stable Form
Sort
View
POPL
1997
ACM
13 years 8 months ago
Call by Need Computations to Root-Stable Form
The following theorem of Huet and L
Aart Middeldorp
CORR
2002
Springer
123views Education» more  CORR 2002»
13 years 4 months ago
Ideal decompositions and computation of tensor normal forms
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...
Bernd Fiedler
CPHYSICS
2010
118views more  CPHYSICS 2010»
13 years 2 months ago
The multithreaded version of FORM
We present TFORM, the version of the symbolic manipulation system FORM that can make simultaneous use of several processors in a shared memory architecture. The implementation use...
M. Tentyukov, J. A. M. Vermaseren
ANSOFT
1998
140views more  ANSOFT 1998»
13 years 4 months ago
FORM: A Feature-Oriented Reuse Method with Domain-Specific Reference Architectures
Systematic discovery and exploitation of commonality across related software systems is a fundamental technical requirement for achieving successful software reuse. By examining a...
Kyo Chul Kang, Sajoong Kim, Jaejoon Lee, Kijoo Kim...
AINA
2007
IEEE
13 years 11 months ago
A Context-Based Delegation Access Control Model for Pervasive Computing
This paper presents an architectural model for contextual-based delegation access control for pervasive computing, particularly access control mechanisms for ad hoc coalition scen...
Ramiro Liscano, Kaining Wang