5115 search results - page 364 / 1023 » On Randomized Lanczos Algorithms |
224
Voted
FUIN
2010
15 years 2 months ago
2010
Machine learning methods are often used to classify objects described by hundreds of attributes; in many applications of this kind a great fraction of attributes may be totally irr...
228
Voted
AAAI
2011
14 years 7 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...
222
click to vote
STOC
2004
ACM
16 years 7 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...
194
Voted
ECCC
2010
15 years 6 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...
217
Voted
CISS
2008
IEEE
16 years 1 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...