757 search results - page 133 / 152 » On the hardness of approximating Max-Satisfy |
129
click to vote
Publication
Non-negative matrix factorization (NMF) has become a standard tool in data mining, information retrieval, and signal processing. It is used to factorize a non-negative data matrix ...
SIGMOD
2012
ACM
13 years 3 days ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
121
Voted
KDD
2012
ACM
13 years 2 days ago
2012
ACM
Multi-task learning (MTL) aims to improve the performance of multiple related tasks by exploiting the intrinsic relationships among them. Recently, multi-task feature learning alg...
131
click to vote
SDM
2012
SIAM
13 years 1 days ago
2012
SIAM
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
111
click to vote
FSTTCS
1993
Springer
15 years 1 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...