Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Markov Random Field is now ubiquitous in many formulations
of various vision problems. Recently, optimization
of higher-order potentials became practical using higherorder
graph...
A nonparametric Bayesian model for histogram clustering is proposed to automatically determine the number of segments when Markov Random Field constraints enforce smooth class assi...