Sciweavers

860 search results - page 53 / 172
» Biased Random Walks
Sort
View
INFOSCALE
2006
ACM
14 years 5 months ago
Storage load balancing via local interactions among peers in unstructured P2P networks
— The present paper introduces a replication method that is meant to balance the storage load of peers in unstructured peer-to-peer (P2P) networks for file sharing and to provid...
Kei Ohnishi, Hiroshi Yamamoto, Kento Ichikawa, Mas...
ICPR
2008
IEEE
14 years 5 months ago
Graph drawing using quantum commute time
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
David Emms, Edwin R. Hancock, Richard C. Wilson
SOFSEM
2004
Springer
14 years 4 months ago
Approaches Based on Markovian Architectural Bias in Recurrent Neural Networks
Recent studies show that state-space dynamics of randomly initialized recurrent neural network (RNN) has interesting and potentially useful properties even without training. More p...
Matej Makula, Michal Cernanský, Lubica Benu...
WWW
2004
ACM
14 years 11 months ago
Efficient pagerank approximation via graph aggregation
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Ja...
INFOCOM
2009
IEEE
14 years 5 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