344 search results - page 65 / 69 » Random Walks on Colored Graphs |
CC
2008
Springer
14 years 9 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
ECCV
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. In this paper we introduce a new salient object segmentation method, which is based on combining a saliency measure with a conditional random field (CRF) model. The propo...
112
click to vote
TIT
2010
14 years 4 months ago
2010
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
107
click to vote
NIPS
2004
14 years 11 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...