Sciweavers

4255 search results - page 317 / 851
» On Learning Boolean Functions
Sort
View
SIAMCOMP
2010
147views more  SIAMCOMP 2010»
15 years 5 months ago
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
ESANN
2006
15 years 8 months ago
Margin based Active Learning for LVQ Networks
In this article, we extend a local prototype-based learning model by active learning, which gives the learner the capability to select training samples during the model adaptation...
Frank-Michael Schleif, Barbara Hammer, Thomas Vill...
IJCNN
2007
IEEE
16 years 29 days ago
Predicting Spike Activity in Neuronal Cultures
be regarded as an abstraction of the underlying effective network connectivity, i.e. its functional connectivity. Although similar functional connectivity models have been describe...
Tayfun Gürel, Ulrich Egert, Steffen Kandler, ...
COLT
2010
Springer
15 years 4 months ago
Convex Games in Banach Spaces
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...
Karthik Sridharan, Ambuj Tewari
IWINAC
2007
Springer
16 years 24 days ago
Requirements for Machine Lifelong Learning
A significant advance in inductive modelling are systems that retain learned knowledge and selectively transfer portions of that knowledge as a source of inductive bias. We defi...
Daniel L. Silver, Ryan Poirier