Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
A structure for implementing lapped transforms with time-varying block sizes is presented which allows full orthogonality of the transient transforms. The formulation is based on ...
Nonnegative Tucker decomposition (NTD) is a recent multiway extension of nonnegative matrix factorization (NMF), where nonnegativity constraints are incorporated into Tucker model...
Co-clustering can be viewed as a two-way (bilinear) factorization of a large data matrix into dense/uniform and possibly overlapping submatrix factors (co-clusters). This combinat...
Hao Zhu, Gonzalo Mateos, Georgios B. Giannakis, Ni...
We compute the singular points of a plane rational curve, parametrically given, using the implicitization matrix derived from the -basis of the curve. It is shown that singularity...