1258 search results - page 118 / 252 » Architecture-driven Problem Decomposition |
140
click to vote
TSP
2008
15 years 1 months ago
2008
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...
160
click to vote
MP
2011
14 years 8 months ago
2011
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
140
Voted
TSP
2011
14 years 8 months ago
2011
—This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications system...
95
Voted
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
In this paper, we revisit the noise-reduction problem in the time domain and present a way to decompose the ltered speech into two uncorrelated (orthogonal) components: the desire...
143
click to vote
KDD
2012
ACM
13 years 4 months ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...