Sciweavers

2463 search results - page 23 / 493
» Rankings of Directed Graphs
Sort
View
IM
2006
13 years 7 months ago
Using PageRank to Characterize Web Structure
Recent work on modeling the web graph has dwelt on capturing the degree distributions observed on the web. Pointing out that this represents a heavy reliance on "local" p...
Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
CIKM
2009
Springer
14 years 2 months ago
Learning to rank from Bayesian decision inference
Ranking is a key problem in many information retrieval (IR) applications, such as document retrieval and collaborative filtering. In this paper, we address the issue of learning ...
Jen-Wei Kuo, Pu-Jen Cheng, Hsin-Min Wang
STACS
2010
Springer
14 years 2 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
GD
1994
Springer
13 years 12 months ago
Visibility Graphs and Oriented Matroids
We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank ...
James Abello, Krishna Kumar
WWW
2004
ACM
14 years 8 months ago
The powerrank web link analysis algorithm
The web graph follows the power law distribution and has a hierarchy structure. But neither the PageRank algorithm nor any of its improvements leverage these attributes. In this p...
Yizhou Lu, Benyu Zhang, Wensi Xi, Zheng Chen, Yi L...