1949 search results - page 97 / 390 » Random graphs on surfaces |
137
click to vote
SODA
2010
ACM
15 years 3 months ago
2010
ACM
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
157
click to vote
MICS
2010
15 years 2 months ago
2010
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
154
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
129
click to vote
PARELEC
2006
IEEE
15 years 10 months ago
2006
IEEE
Usually, theories of surface growth are based on the study of global processes without taking in account the local behaviour of atoms. We have implemented two Montecarlo simulation...
141
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Classifying an event captured in an image is useful for understanding the contents of the image. The captured event provides context to refine models for the presence and appearan...