1068 search results - page 80 / 214 » Factorization as a Rank 1 Problem |
129
click to vote
CIKM
2011
Springer
14 years 3 months ago
2011
Springer
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
120
click to vote
NIPS
2008
15 years 4 months ago
2008
We study the behavior of block 1/ 2 regularization for multivariate regression, where a K-dimensional response vector is regressed upon a fixed set of p covariates. The problem of...
116
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
117
click to vote
FOCS
1993
IEEE
15 years 7 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
146
click to vote
TALG
2010
14 years 10 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...