1161 search results - page 128 / 233 » Kinetic Dependence Graphs |
85
Voted
WOLLIC
2007
Springer
15 years 6 months ago
2007
Springer
Hydra games were introduced by Kirby and Paris, for the formulation of a result which is independent from Peano arithmetic but depends on the transfinite structure of 0. Tree ordi...
109
click to vote
IPPS
2005
IEEE
15 years 6 months ago
2005
IEEE
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
AIRWEB
2005
Springer
15 years 6 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...
114
Voted
IICS
2005
Springer
15 years 6 months ago
2005
Springer
We provide an approach to distribute the calculation of PageRank, by splitting the graph into its strongly connected components. As we prove, the global ranking may be calculated c...
113
click to vote
ICDAR
2003
IEEE
15 years 6 months ago
2003
IEEE
A new system is presented for general symbol segmentation, which is applicable for segmentation of any connected string of symbols, including characters and line diagrams. Using a...