288 search results - page 18 / 58 » Notes on computing minimal approximant bases |
AUTOMATICA
2008
13 years 10 months ago
2008
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...
APPROX
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
JMIV
2010
13 years 4 months ago
2010
This paper proposes robust algorithms to deconvolve discrete noised signals and images. The solutions are derived as linear combinations of spline wavelet packets that minimize so...
ICML
2004
IEEE
14 years 10 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
COMGEO
2004
ACM
13 years 9 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...