180 search results - page 34 / 36 » Learning random walks to rank nodes in graphs |
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
1 This paper presents a new approach to trusted Grid computing in a Peer-to-Peer (P2P) setting. Trust and security are essential to establish lasting working relationships among th...
GLOBECOM
2006
IEEE
13 years 12 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
IPSN
2011
Springer
12 years 9 months ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
CORR
2011
Springer
13 years 23 days ago
2011
Springer
We analyze the recent phenomenon termed a Link Bomb, and investigate the optimal attack pattern for a group of web pages attempting to link bomb a specific web page. The typical ...
AIRWEB
2005
Springer
13 years 11 months ago
2005
Springer
We analyze the recent phenomenon termed a Link Bomb, and investigate the optimal attack pattern for a group of web pages attempting to link bomb a specific web page. The typical ...