Sciweavers

127 search results - page 1 / 26
» Call by Need Computations to Root-Stable Form
Sort
View
135
Voted
POPL
1997
ACM
15 years 4 months ago
Call by Need Computations to Root-Stable Form
The following theorem of Huet and L
Aart Middeldorp
110
Voted
CORR
2002
Springer
123views Education» more  CORR 2002»
15 years 28 days 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
116
Voted
CPHYSICS
2010
118views more  CPHYSICS 2010»
14 years 10 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
105
Voted
ANSOFT
1998
140views more  ANSOFT 1998»
15 years 25 days 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...
118
Voted
AINA
2007
IEEE
15 years 7 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