2079 search results - page 284 / 416 » Universality of random graphs |
119
click to vote
AIRWEB
2005
Springer
15 years 10 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...
116
click to vote
CSCLP
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
176
click to vote
ACST
2006
15 years 6 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
146
click to vote
NIPS
2001
15 years 6 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
112
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Information-theoretic security--widely accepted as the strictest notion of security--relies on channel coding techniques that exploit the inherent randomness of propagation channel...