Sciweavers

2463 search results - page 33 / 493
» Rankings of Directed Graphs
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Local Graph Partitioning using PageRank Vectors
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...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
CVPR
2011
IEEE
13 years 3 months ago
Noise Resistant Graph Ranking for Improved Web Image Search
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...
Wei Liu, Yu-Gang Jiang, Jiebo Luo, Shih-Fu Chang
JCT
2008
96views more  JCT 2008»
13 years 7 months ago
Graphs with full rank 3-color matrix and few 3-colorings
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...
Serguei Norine, Jean-Sébastien Sereni
ENTCS
2002
118views more  ENTCS 2002»
13 years 7 months ago
Rank 2 Types for Term Graph Rewriting
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...
Steffen van Bakel
IM
2007
13 years 7 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito