Sciweavers

223 search results - page 31 / 45
» Pattern Search Methods for Linearly Constrained Minimization
Sort
View
ICRA
2006
IEEE
110views Robotics» more  ICRA 2006»
14 years 1 months ago
Transfer of Learning for Complex Task Domains: a Demonstration using Multiple Robots
— This paper demonstrates a learning mechanism for complex tasks. Such tasks may be inherently expensive to learn in terms of training time and/or cost of obtaining each training...
Sameer Singh, Julie A. Adams
ICML
2010
IEEE
13 years 8 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
ICASSP
2009
IEEE
14 years 2 months ago
Sparse source separation from orthogonal mixtures
This paper addresses source separation from a linear mixture under two assumptions: source sparsity and orthogonality of the mixing matrix. We propose efficient sparse separation...
Moshe Mishali, Yonina C. Eldar
IPL
2010
114views more  IPL 2010»
13 years 5 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
CVPR
2008
IEEE
14 years 1 months ago
Subspace segmentation with outliers: A grassmannian approach to the maximum consensus subspace
Segmenting arbitrary unions of linear subspaces is an important tool for computer vision tasks such as motion and image segmentation, SfM or object recognition. We segment subspac...
Nuno Pinho da Silva, João Paulo Costeira