Sciweavers

27 search results - page 5 / 6
» On a graph coloring problem arising from discrete tomography
Sort
View
DAC
2004
ACM
14 years 6 months ago
Exploiting structure in symmetry detection for CNF
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
Paul T. Darga, Mark H. Liffiton, Karem A. Sakallah...
CVPR
2003
IEEE
14 years 7 months ago
Nonparametric Belief Propagation
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
Erik B. Sudderth, Alexander T. Ihler, William T. F...
AAAI
1998
13 years 6 months ago
"Squeaky Wheel" Optimization
We describe a general approach to optimization which we term Squeaky Wheel" Optimization SWO. In SWO, a greedy algorithm is used to construct a solution which is then analyze...
David Joslin, David P. Clements
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 5 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 5 months ago
Learning to rank with combinatorial Hodge theory
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye