Sciweavers

5138 search results - page 155 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
ICASSP
2007
IEEE
15 years 9 months ago
Markov Random Field Energy Minimization via Iterated Cross Entropy with Partition Strategy
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...
Jue Wu, Albert C. S. Chung
MM
2006
ACM
190views Multimedia» more  MM 2006»
15 years 9 months ago
Image annotation refinement using random walk with restarts
Image annotation plays an important role in image retrieval and management. However, the results of the state-of-the-art image annotation methods are often unsatisfactory. Therefo...
Changhu Wang, Feng Jing, Lei Zhang, HongJiang Zhan...
COMPGEOM
2008
ACM
15 years 4 months ago
The complexity of the outer face in arrangements of random segments
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sh...
CORR
2008
Springer
102views Education» more  CORR 2008»
15 years 3 months ago
Finding cores of random 2-SAT formulae via Poisson cloning
For the random 2-SAT formula F(n, p), let FC(n, p) be the formula left after the pure literal algorithm applied to F(n, p) stops. Using the recently developed Poisson cloning model...
Jeong Han Kim
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 3 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah