5153 search results - page 372 / 1031 » Introduction to Randomized Algorithms |
161
click to vote
AAAI
2011
14 years 4 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
155
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
124
click to vote
ECCC
2010
15 years 3 months ago
2010
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
161
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...
111
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
Compressive Sensing (CS) is an emerging area which uses a relatively small number of non-traditional samples in the form of randomized projections to reconstruct sparse or compres...