1591 search results - page 192 / 319 » Random lifts of graphs |
164
click to vote
CDC
2008
IEEE
16 years 27 days ago
2008
IEEE
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
213
click to vote
ERCIMDL
2010
Springer
15 years 7 months ago
2010
Springer
Abstract Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In t...
190
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particula...
186
click to vote
JAL
2000
15 years 6 months ago
2000
Random independent sets in graphs arise, for example, in statistical physics, in the hard-core model of a gas. In 1997, Luby and Vigoda described a rapidly mixing Markov chain for...
210
click to vote
PAMI
2007
15 years 6 months ago
2007
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...