5115 search results - page 620 / 1023 » On Randomized Lanczos Algorithms |
189
click to vote
TIT
2010
15 years 1 months ago
2010
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
155
click to vote
TIT
2010
15 years 1 months ago
2010
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
217
click to vote
TWC
2010
15 years 1 months ago
2010
In this paper we consider practical dissemination algorithms exploiting network coding for data broadcasting in ad hoc wireless networks. For an efcient design, we analyze issues r...
202
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
Spatially-discrete Markov random fields (MRFs) and spatially-continuous variational approaches are ubiquitous in low-level vision, including image restoration, segmentation, opti...
181
click to vote
ICASSP
2011
IEEE
14 years 10 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...