Sciweavers

384 search results - page 15 / 77
» Eliciting properties of probability distributions
Sort
View
FOCS
2007
IEEE
15 years 6 months ago
Polylogarithmic Independence Can Fool DNF Formulas
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...
Louay Bazzi
ICCV
2001
IEEE
16 years 1 months ago
The Earth Mover's Distance is the Mallows Distance: Some Insights from Statistics
The Earth Mover's distance was first introduced as a purely empirical way to measure texture and color similarities. We show that it has a rigorous probabilistic interpretati...
Elizaveta Levina, Peter J. Bickel
LPAR
2005
Springer
15 years 5 months ago
Towards Automated Proof Support for Probabilistic Distributed Systems
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...
Annabelle McIver, Tjark Weber
BMVC
2000
15 years 1 months ago
Statistical Properties of the Hybrid Radon-Fourier Technique
The hybrid Radon-Fourier technique has been proposed for the discrimination and tracking of deforming and compound targets. The current work investigates the technique's uniq...
Violet F. Leavers
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 3 days ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking