518 search results - page 48 / 104 » Beating a Random Assignment |
121
Voted
ECCV
2010
Springer
15 years 7 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...
119
Voted
AAAI
2008
15 years 4 months ago
2008
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...
132
click to vote
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
102
Voted
JSAT
2008
15 years 2 months ago
2008
We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior o...
143
click to vote
CIKM
2010
Springer
15 years 16 days ago
2010
Springer
Dealing with verbose (or long) queries poses a new challenge for information retrieval. Selecting a subset of the original query (a "sub-query") has been shown to be an ...