Sciweavers

5580 search results - page 712 / 1116
» Randomized priority algorithms
Sort
View
TIT
2010
82views Education» more  TIT 2010»
14 years 10 months ago
Average message delivery time for small-world networks in the continuum limit
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...
Hazer Inaltekin, Mung Chiang, H. Vincent Poor
180
Voted
TWC
2010
14 years 10 months ago
Toward network coding-based protocols for data broadcasting in wireless Ad Hoc networks
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...
Alfred Asterjadhi, Elena Fasolo, Michele Rossi, J&...
164
Voted
CVPR
2011
IEEE
14 years 7 months ago
Connecting Non-Quadratic Variational Models and MRFs
Spatially-discrete Markov random fields (MRFs) and spatially-continuous variational approaches are ubiquitous in low-level vision, including image restoration, segmentation, opti...
Kevin Schelten, Stefan Roth
ICASSP
2011
IEEE
14 years 7 months ago
Langevin and hessian with fisher approximation stochastic sampling for parameter estimation of structured covariance
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...
Cornelia Vacar, Jean-François Giovannelli, ...
ICASSP
2011
IEEE
14 years 7 months ago
Powerful extensions to CRFS for grapheme to phoneme conversion
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...
Stefan Hahn, Patrick Lehnen, Hermann Ney