Sciweavers

36 search results - page 4 / 8
» Learning Fast Approximations of Sparse Coding
Sort
View
PC
2010
101views Management» more  PC 2010»
13 years 4 months ago
An efficient parallel implementation of the MSPAI preconditioner
We present an efficient implementation of the Modified SParse Approximate Inverse (MSPAI) preconditioner. MSPAI generalizes the class of preconditioners based on Frobenius norm mi...
Thomas Huckle, A. Kallischko, A. Roy, M. Sedlacek,...
NECO
2008
114views more  NECO 2008»
13 years 9 months ago
A Sparse Generative Model of V1 Simple Cells with Intrinsic Plasticity
Current models for the learning of feature detectors work on two time scales: on a fast time scale the internal neurons' activations adapt to the current stimulus; on a slow ...
Cornelius Weber, Jochen Triesch
CVPR
2008
IEEE
14 years 11 months ago
Sparse probabilistic regression for activity-independent human pose inference
Discriminative approaches to human pose inference involve mapping visual observations to articulated body configurations. Current probabilistic approaches to learn this mapping ha...
Raquel Urtasun, Trevor Darrell
CVPR
2010
IEEE
14 years 5 months ago
SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
Ruei-Sung Lin, David Ross, Jay Yagnik
NIPS
2000
13 years 11 months ago
A New Approximate Maximal Margin Classification Algorithm
A new incremental learning algorithm is described which approximates the maximal margin hyperplane w.r.t. norm p 2 for a set of linearly separable data. Our algorithm, called alm...
Claudio Gentile