394 search results - page 34 / 79 » Computing Minimal Polynomials of Matrices |
DBA
2006
15 years 1 months ago
2006
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
84
Voted
AAECC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We review a binary sequence based on the generalized cyclotomy of order 2 with respect to p3 , where p is an odd prime. Linear complexities, minimal polynomials and autoc...
82
Voted
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D ...
105
Voted
CORR
2007
Springer
15 years 14 days ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...