19 search results - page 1 / 4 » Ideal decompositions and computation of tensor normal forms |
CORR
2002
Springer
13 years 10 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...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal I. The criterion used in the computation involves specific commutation polynomial...
CVPR
2005
IEEE
15 years 27 days ago
2005
IEEE
While spectral clustering has been applied successfully to problems in computer vision, their applicability is limited to pairwise similarity measures that form a probability matr...
ISSAC
2005
Springer
14 years 4 months ago
2005
Springer
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
SKG
2006
IEEE
14 years 4 months ago
2006
IEEE
The paper studies “equality” in XML model decomposition. XML IFD, TFD, AFD and MVD are proposed. According to complexity of these FDs, four XML normal forms are presented. FD ...