507 search results - page 39 / 102 » Computing Sparse Multiples of Polynomials |
SIAMNUM
2010
13 years 2 months ago
2010
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
ICIP
2007
IEEE
14 years 2 months ago
2007
IEEE
In a wide variety of imaging applications (especially medical imaging), we obtain a partial set or subset of the Fourier transform of an image. From these Fourier measurements, we...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We derive algorithms for finding a nonnegative n-dimensional tensor factorization (n-NTF) which includes the non-negative matrix factorization (NMF) as a particular case when n = ...
UAI
2008
13 years 9 months ago
2008
Much recent work has concerned sparse approximations to speed up the Gaussian process regression from the unfavorable O(n3 ) scaling in computational time to O(nm2 ). Thus far, wo...