Sciweavers

157 search results - page 20 / 32
» On Bayesian bounds
Sort
View
ESANN
2006
13 years 11 months ago
Semi-Blind Approaches for Source Separation and Independent component Analysis
Abstract. This paper is a survey of semi-blind source separation approaches. Since Gaussian iid signals are not separable, simplest priors suggest to assume non Gaussian iid signal...
Massoud Babaie-Zadeh, Christian Jutten
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 10 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson
ICASSP
2010
IEEE
13 years 10 months ago
Fundamental limits of image denoising: Are we there yet?
In this paper, we study the fundamental performance limits of image denoising where the aim is to recover the original image from its noisy observation. Our study is based on a ge...
Priyam Chatterjee, Peyman Milanfar
CSFW
2007
IEEE
14 years 4 months ago
Probability of Error in Information-Hiding Protocols
Randomized protocols for hiding private information can often be regarded as noisy channels in the informationtheoretic sense, and the inference of the concealed information can b...
Konstantinos Chatzikokolakis, Catuscia Palamidessi...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 10 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden