139 search results - page 3 / 28 » Sparse Projections over Graph |
135
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
ICASSP
2009
IEEE
14 years 9 months ago
2009
IEEE
This paper studies compressed sensing for the recovery of non-negative sparse vectors from a smaller number of measurements than the ambient dimension of the unknown vector. We fo...
JMLR
2006
14 years 11 months ago
2006
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
104
Voted
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a p-adic lifting technique combined with the use of block matr...
127
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...