Sciweavers

3250 search results - page 302 / 650
» Parameterized Learning Complexity
Sort
View
NECO
2006
103views more  NECO 2006»
15 years 4 months ago
Optimal Spike-Timing-Dependent Plasticity for Precise Action Potential Firing in Supervised Learning
In timing-based neural codes, neurons have to emit action potentials at precise moments in time. We use a supervised learning paradigm to derive a synaptic update rule that optimi...
Jean-Pascal Pfister, Taro Toyoizumi, David Barber,...
IR
2000
15 years 4 months ago
Automating the Construction of Internet Portals with Machine Learning
Domain-specific internet portals are growing in popularity because they gather content from the Web and organize it for easy access, retrieval and search. For example, www.campsear...
Andrew McCallum, Kamal Nigam, Jason Rennie, Kristi...
BMVC
2010
15 years 3 months ago
Manifold Learning for Multi-Modal Image Registration
The standard approach to multi-modal registration is to apply sophisticated similarity metrics such as mutual information. The disadvantage of these measures, in contrast to simpl...
Christian Wachinger, Nassir Navab
CC
2010
Springer
120views System Software» more  CC 2010»
15 years 2 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
CVPR
2011
IEEE
15 years 1 months ago
Learning Message-Passing Inference Machines for Structured Prediction
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
Stephane Ross, Daniel Munoz, J. Andrew Bagnell