598 search results - page 67 / 120 » A random graph model for massive graphs |
121
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
HICSS
2006
IEEE
15 years 5 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
106
click to vote
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
EMMCVPR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper presents a Bayesian inference algorithm for image layer representation [26], 2.1D sketch [6], with mixed Markov random field. 2.1D sketch is an very important...
104
click to vote
CORR
2008
Springer
14 years 12 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...