1909 search results - page 223 / 382 » Generalized Filtering Decomposition |
143
click to vote
WDAG
2010
Springer
15 years 24 days ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
100
click to vote
SIGSOFT
2010
ACM
15 years 9 days ago
2010
ACM
Reliance on skilled developers reduces the return on investment for important software engineering tasks such as establishing program correctness. This position paper introduces a...
119
click to vote
ICDM
2009
IEEE
15 years 5 days ago
2009
IEEE
In this paper, we restudy the non-convex data factorization problems (regularized or not, unsupervised or supervised), where the optimization is confined in the nonnegative orthan...
106
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
The multiplicative algorithms are well-known for nonnegative matrix and tensor factorizations. The ALS algorithm for canonical decomposition (CP) has been proved as a “workhorse...
115
click to vote
SIGIR
2009
ACM
15 years 9 months ago
2009
ACM
Search and recommendation systems must include contextual information to effectively model users’ interests. In this paper, we present a systematic study of the effectiveness of...