394 search results - page 52 / 79 » Computing Minimal Polynomials of Matrices |
JSC
2010
14 years 11 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
104
Voted
KDD
2004
ACM
16 years 27 days ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— We consider the problem of designing space-timefrequency linear dispersion (LD) codes in wideband multipleinput multiple-output (MIMO) antenna systems employing orthogo...
123
click to vote
ANOR
2010
14 years 10 months ago
2010
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...
109
click to vote
PC
2010
14 years 7 months ago
2010
We present an efficient implementation of the Modified SParse Approximate Inverse (MSPAI) preconditioner. MSPAI generalizes the class of preconditioners based on Frobenius norm mi...