Sciweavers

4255 search results - page 91 / 851
» On Learning Boolean Functions
Sort
View
CVPR
2008
IEEE
15 years 12 months ago
Exact inference in multi-label CRFs with higher order cliques
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
Srikumar Ramalingam, Pushmeet Kohli, Karteek Alaha...
CORR
2008
Springer
95views Education» more  CORR 2008»
14 years 10 months ago
Some properties of the regular asynchronous systems
: The asynchronous systems are the models of the asynchronous circuits from the digital electrical engineering. An asynchronous system f is a multi-valued function that assigns to ...
Serban E. Vlad
ALDT
2009
Springer
207views Algorithms» more  ALDT 2009»
15 years 4 months ago
Anytime Self-play Learning to Satisfy Functional Optimality Criteria
We present an anytime multiagent learning approach to satisfy any given optimality criterion in repeated game self-play. Our approach is opposed to classical learning approaches fo...
Andriy Burkov, Brahim Chaib-draa
ESANN
2003
14 years 11 months ago
Approximation of Function by Adaptively Growing Radial Basis Function Neural Networks
In this paper a neural network for approximating function is described. The activation functions of the hidden nodes are the Radial Basis Functions (RBF) whose parameters are learn...
Jianyu Li, Siwei Luo, Yingjian Qi
FOCS
2007
IEEE
15 years 4 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