Sciweavers

180 search results - page 16 / 36
» Learning random walks to rank nodes in graphs
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
On Node Isolation Under Churn in Unstructured P2P Networks with Heavy-Tailed Lifetimes
— Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this ...
Zhongmei Yao, Xiaoming Wang, Derek Leonard, Dmitri...
ICPR
2010
IEEE
13 years 10 months ago
Topic-Sensitive Tag Ranking
Social tagging is an increasingly popular way to describe and classify documents on the web. However, the quality of the tags varies considerably since the tags are authored freel...
Yan'An Jin, Ruixuan Li, Zhengding Lu, Kunmei Wen, ...
STACS
2007
Springer
14 years 1 months ago
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
Robert Elsässer, Thomas Sauerwald
INFOCOM
2009
IEEE
14 years 2 months ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu
JSAC
2010
188views more  JSAC 2010»
13 years 2 months ago
Random-walk based approach to detect clone attacks in wireless sensor networks
Abstract--Wireless sensor networks (WSNs) deployed in hostile environments are vulnerable to clone attacks. In such attack, an adversary compromises a few nodes, replicates them, a...
Yingpei Zeng, Jiannong Cao, Shigeng Zhang, Shanqin...