Sciweavers

5580 search results - page 606 / 1116
» Randomized priority algorithms
Sort
View
SAT
2010
Springer
172views Hardware» more  SAT 2010»
15 years 3 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
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 ...
Denis Pankratov, Allan Borodin
ECCC
2011
282views ECommerce» more  ECCC 2011»
14 years 11 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
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...
Noga Alon, Shachar Lovett
157
Voted
JCSS
2008
120views more  JCSS 2008»
15 years 5 months ago
Quantum certificate complexity
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...
Scott Aaronson
ICCV
2009
IEEE
16 years 10 months ago
Higher-Order Gradient Descent by Fusion-Move Graph Cut
Markov Random Field is now ubiquitous in many formulations of various vision problems. Recently, optimization of higher-order potentials became practical using higherorder graph...
Hiroshi Ishikawa
ECCV
2006
Springer
16 years 6 months ago
Smooth Image Segmentation by Nonparametric Bayesian Inference
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...
Peter Orbanz, Joachim M. Buhmann