1763 search results - page 128 / 353 » Dependent random choice |
AAAI
2010
13 years 9 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
AAAI
2008
13 years 10 months ago
2008
This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic gam...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Kernel machines (e.g. SVM, KLDA) have shown state-ofthe-art performance in several visual classification tasks. The classification performance of kernel machines greatly depends o...