865 search results - page 74 / 173 » Random graph models for the web graph |
139
Voted
WWW
2010
ACM
15 years 10 months ago
2010
ACM
Query suggestion has been an effective approach to help users narrow down to the information they need. However, most of existing studies focused on only popular/head queries. Si...
125
click to vote
DM
2007
15 years 3 months ago
2007
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
156
Voted
COMGEO
1999
ACM
15 years 3 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
150
Voted
JMLR
2012
13 years 6 months ago
2012
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
113
click to vote
AIRWEB
2005
Springer
15 years 9 months ago
2005
Springer
We study the impact of collusion –nepotistic linking– in a Web graph in terms of Pagerank. We prove a bound on the Pagerank increase that depends both on the reset probability...