Sciweavers

886 search results - page 62 / 178
» Learning Distance Functions using Equivalence Relations
Sort
View
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
14 years 4 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
ICML
2007
IEEE
15 years 10 months ago
Non-isometric manifold learning: analysis and an algorithm
In this work we take a novel view of nonlinear manifold learning. Usually, manifold learning is formulated in terms of finding an embedding or `unrolling' of a manifold into ...
Piotr Dollár, Serge J. Belongie, Vincent Ra...
PUC
2006
81views more  PUC 2006»
14 years 9 months ago
Social functions of location in mobile telephony
Location appears to be one of the most important aspects of context in mobile communication. It is a complex piece of information involving several levels of detail. Location inter...
Ilkka Arminen
ML
2002
ACM
146views Machine Learning» more  ML 2002»
14 years 9 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
14 years 10 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke