1511 search results - page 77 / 303 » Randomness, lowness and degrees |
142
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
202
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Image restoration is a keen problem of low level vision. In this paper, we propose a novel - assumption-free on the noise model - technique based on random walks for image enhancem...
142
click to vote
COMPGEOM
2009
ACM
16 years 21 days ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
140
click to vote
ICC
2007
IEEE
16 years 15 days ago
2007
IEEE
Abstract— This paper proposes the opportunistic power allocation (OPA) scheme for random beamforming with a limited feedback rate. Without the channel state information, the prop...
179
click to vote
ECCV
1994
Springer
15 years 10 months ago
1994
Springer
A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is dened as the maximum a posteriori (MAP) probability estimate...