518 search results - page 18 / 104 » Beating a Random Assignment |
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
ICIP
2009
IEEE
15 years 11 months ago
2009
IEEE
We propose a binary Markov Random Field (MRF) model
that assigns high probability to regions in the image domain
consisting of an unknown number of circles of a given radius.
We...
EUSFLAT
2003
15 years 1 months ago
2003
In this paper we propose a random set framework for learning linguistic models for prediction problems. We show how we can model prediction problems based on learning linguistic p...
COMPGEOM
1993
ACM
15 years 3 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
110
click to vote
IJCAI
2003
15 years 1 months ago
2003
For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can ...