860 search results - page 87 / 172 » Biased Random Walks |
120
click to vote
IMC
2010
ACM
14 years 10 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
109
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
98
Voted
TIP
2010
14 years 7 months ago
2010
One weakness in the existing interactive image segmentation algorithms is the lack of more intelligent ways to understand the intention of user inputs. In this paper, we advocate t...
100
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...
120
Voted
TVCG
2012
13 years 3 months ago
2012
—In this paper, we study the sensitivity of centrality metrics as a key metric of social networks to support visual reasoning. As centrality represents the prestige or importance...