Sciweavers

64 search results - page 5 / 13
» Locally Competitive Algorithms for Sparse Approximation
Sort
View
CORR
2010
Springer
172views Education» more  CORR 2010»
13 years 7 months ago
The MUSIC Algorithm for Sparse Objects: A Compressed Sensing Analysis
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...
Albert Fannjiang
ICML
2010
IEEE
13 years 8 months ago
A scalable trust-region algorithm with application to mixed-norm regression
We present a new algorithm for minimizing a convex loss-function subject to regularization. Our framework applies to numerous problems in machine learning and statistics; notably,...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
JMLR
2008
188views more  JMLR 2008»
13 years 6 months ago
Maximal Causes for Non-linear Component Extraction
We study a generative model in which hidden causes combine competitively to produce observations. Multiple active causes combine to determine the value of an observed variable thr...
Jörg Lücke, Maneesh Sahani
ICRA
2008
IEEE
169views Robotics» more  ICRA 2008»
14 years 1 months ago
Sparse incremental learning for interactive robot control policy estimation
— We are interested in transferring control policies for arbitrary tasks from a human to a robot. Using interactive demonstration via teloperation as our transfer scenario, we ca...
Daniel H. Grollman, Odest Chadwicke Jenkins
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
14 years 1 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia