Sciweavers

552 search results - page 56 / 111
» Observable Graphs
Sort
View
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
13 years 9 months ago
PageRank and the random surfer model
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....
Prasad Chebolu, Páll Melsted
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 8 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
CVPR
2007
IEEE
14 years 10 months ago
Learning GMRF Structures for Spatial Priors
The goal of this paper is to find sparse and representative spatial priors that can be applied to part-based object localization. Assuming a GMRF prior over part configurations, w...
Lie Gu, Eric P. Xing, Takeo Kanade
NOMS
2002
IEEE
130views Communications» more  NOMS 2002»
14 years 27 days ago
End-to-end service failure diagnosis using belief networks
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
Malgorzata Steinder, Adarshpal S. Sethi
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 8 months ago
Locally computable approximations for spectral clustering and absorption times of random walks
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos...