10054 search results - page 21 / 2011 » On the Complexity of Function Learning |
CIE
2010
Springer
14 years 2 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
PODS
2005
ACM
14 years 10 months ago
2005
ACM
CVPR
2006
IEEE
14 years 12 months ago
2006
IEEE
Motion estimation for applications where appearance undergoes complex changes is challenging due to lack of an appropriate similarity function. In this paper, we propose to learn ...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
JAT
2010
13 years 4 months ago
2010
We describe the theoretical solution of an approximation problem that uses a finite weighted sum of complex exponential functions. The problem arises in an optimization model for t...