2434 search results - page 247 / 487 » Algorithmic Randomness of Closed Sets |
151
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
146
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We present a random field based model for stereo vision with explicit occlusion labeling in a probabilistic framework. The model employs non-parametric cost functions that can be ...
133
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
138
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
The emerging theory of compressed sensing (CS) provides a universal signal detection approach for sparse signals at sub-Nyquist sampling rates. A small number of random projection...
141
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...