Sciweavers

6045 search results - page 23 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
CORR
2002
Springer
123views Education» more  CORR 2002»
13 years 7 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
SOFSEM
2000
Springer
13 years 11 months ago
Computing the Dimension of Linear Subspaces
Abstract. Since its very beginning, linear algebra is a highly algorithmic subject. Let us just mention the famous Gau
Martin Ziegler, Vasco Brattka
BIRTHDAY
2007
Springer
14 years 1 months ago
Linear Recursive Functions
Abstract. With the recent trend of analysing the process of computation through the linear logic looking glass, it is well understood that the ability to copy and erase data is ess...
Sandra Alves, Maribel Fernández, Már...
HICSS
2003
IEEE
98views Biometrics» more  HICSS 2003»
14 years 1 months ago
On the Limits of Bottom-Up Computer Simulation: Towards a Nonlinear Modeling Culture
1 In the complexity and simulation communities there is growing support for the use of bottom-up computer-based simulation in the analysis of complex systems. The presumption is th...
Kurt A. Richardson
ACL
2010
13 years 5 months ago
On the Computational Complexity of Dominance Links in Grammatical Formalisms
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
Sylvain Schmitz