Sciweavers

338 search results - page 14 / 68
» Fast distributed random walks
Sort
View
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
15 years 10 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...
DCOSS
2005
Springer
14 years 11 months ago
An Adaptive Blind Algorithm for Energy Balanced Data Propagation in Wireless Sensors Networks
In this paper, we consider the problem of energy balanced data propagation in wireless sensor networks and we generalise previous works by allowing realistic energy assignment. A n...
Pierre Leone, Sotiris E. Nikoletseas, José ...
ICASSP
2011
IEEE
14 years 1 months ago
Fast network querying algorithm for searching large-scale biological networks
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...
Sayed Mohammad Ebrahim Sahraeian, Byung-Jun Yoon
CIMCA
2006
IEEE
15 years 3 months ago
Model-driven Walks for Resource Discovery in Peer-to-Peer Networks
In this paper, a distributed and adaptive approach for resource discovery in peer-to-peer networks is presented. This approach is based on the mobile agent paradigm and the random...
Mohamed Bakhouya, Jaafar Gaber
PVLDB
2010
220views more  PVLDB 2010»
14 years 4 months ago
Fast Incremental and Personalized PageRank
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
Bahman Bahmani, Abdur Chowdhury, Ashish Goel