Sciweavers

364 search results - page 5 / 73
» Computing Communities in Large Networks Using Random Walks
Sort
View
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 6 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
RT
1998
Springer
13 years 10 months ago
Global Ray-Bundle Tracing with Hardware Acceleration
The paper presents a single-pass, view-dependent method to solve the general rendering equation, using a combined finite element and random walk approach. Applying finite element t...
László Szirmay-Kalos, Werner Purgath...
INFOCOM
2012
IEEE
11 years 8 months ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
INFOCOM
2007
IEEE
14 years 2 days ago
Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes
Abstract—It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the sc...
Yunfeng Lin, Ben Liang, Baochun Li
CVPR
2012
IEEE
11 years 8 months ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee