Sciweavers

70 search results - page 2 / 14
» Learning Fourier Sparse Set Functions
Sort
View
ICML
2005
IEEE
14 years 6 months ago
A practical generalization of Fourier-based learning
This paper presents a search algorithm for finding functions that are highly correlated with an arbitrary set of data. The functions found by the search can be used to approximate...
Adam Drake, Dan Ventura
JMLR
2008
133views more  JMLR 2008»
13 years 5 months ago
Algorithms for Sparse Linear Classifiers in the Massive Data Setting
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
Suhrid Balakrishnan, David Madigan
ICPR
2006
IEEE
14 years 6 months ago
Learning Wormholes for Sparsely Labelled Clustering
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance f...
Eng-Jon Ong, Richard Bowden
CVPR
2011
IEEE
12 years 9 months ago
Nonlinear Shape Manifolds as Shape Priors in Level Set Segmentation and Tracking
We propose a novel nonlinear, probabilistic and variational method for adding shape information to level setbased segmentation and tracking. Unlike previous work, we represent sha...
Victor Prisacariu, Ian Reid
ICRA
2008
IEEE
169views Robotics» more  ICRA 2008»
13 years 11 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