Sciweavers

5580 search results - page 177 / 1116
» Randomized priority algorithms
Sort
View
TIP
2010
189views more  TIP 2010»
14 years 8 months ago
Image Inpainting by Patch Propagation Using Patch Sparsity
Abstract—This paper introduces a novel examplar-based inpainting algorithm through investigating the sparsity of natural image patches. Two novel concepts of sparsity at the patc...
Zongben Xu, Jian Sun
80
Voted
ICC
2008
IEEE
155views Communications» more  ICC 2008»
15 years 4 months ago
Adaptive Random Network Coding in WiMAX
—The IEEE 802.16 standard, or WiMAX, has emerged as one of the strongest contenders for broadband wireless access technology. In our previous work, we proposed a protocol using r...
Jin Jin, Baochun Li
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 4 days ago
Optimal Random Matchings on Trees and Applications
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
Jeff Abrahamson, Béla Csaba, Ali Shokoufand...
61
Voted
TIP
2011
89views more  TIP 2011»
14 years 5 months ago
Random Phase Textures: Theory and Synthesis
This paper explores the mathematical and algorithmic properties of two sample-based microtexture models: random phase noise (RPN ) and asymptotic discrete spot noise (ADSN ). Thes...
Bruno Galerne, Yann Gousseau, Jean-Michel Morel
79
Voted
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
15 years 10 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige