1067 search results - page 182 / 214 » Probabilistic regular graphs |
MIDDLEWARE
2007
Springer
15 years 6 months ago
2007
Springer
Many wireless sensor network protocols are employing gossipbased message dissemination, where nodes probabilistically forward messages, to reduce message overhead. We are concerne...
129
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
149
click to vote
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
88
Voted
ICCV
2009
IEEE
16 years 5 months ago
2009
IEEE
This paper is focused on the Co-segmentation problem
[1] – where the objective is to segment a similar object from
a pair of images. The background in the two images may be
ar...
98
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
We propose a global optimization framework for 3D shape reconstruction from sparse noisy 3D measurements frequently encountered in range scanning, sparse featurebased stereo, and ...