Sciweavers

373 search results - page 56 / 75
» On Deterministic Approximation of DNF
Sort
View
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
14 years 4 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
SWAT
2004
Springer
103views Algorithms» more  SWAT 2004»
14 years 3 months ago
Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
Mark de Berg, Sergio Cabello, Panos Giannopoulos, ...
IJON
1998
158views more  IJON 1998»
13 years 9 months ago
Bayesian Kullback Ying-Yang dependence reduction theory
Bayesian Kullback Ying—Yang dependence reduction system and theory is presented. Via stochastic approximation, implementable algorithms and criteria are given for parameter lear...
Lei Xu
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
14 years 10 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan
POPL
2007
ACM
14 years 10 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic