In this paper, we consider alternate ways of storing a sparse matrix and their effect on computational speed. They involve keeping both the indices and the non-zero elements in t...
tection via Structural Abstraction William S. Evans Department of Computer Science University of British Columbia Vancouver, B.C. V6T 1Z4, CANADA Christopher W. Fraser Microsoft Re...
The analysis of audio signals of popular and rock songs of the versechorus form to reconstruct its original musical structures is investigated in this work. We first compute the ...
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...