2100 search results - page 37 / 420 » Learning to rank on graphs |
195
click to vote
SDM
2011
SIAM
14 years 16 days ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
114
click to vote
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
110
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
In this paper, we exploit a novel ranking mechanism that processes query samples with noisy labels, motivated by the practical application of web image search re-ranking where the...
JCT
2008
14 years 9 months ago
2008
We exhibit a a counterexample to a conjecture of Thomassen stating that the number of distinct 3-colorings of every graph whose 3color matrix has full column rank is superpolynomi...
ENTCS
2002
14 years 9 months ago
2002
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assign...